1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
#include <iostream>
#include <set>

using namespace std;

unsigned int n, k;
unsigned int p[30];
set <unsigned int> s;

int main()
{
    cin>>k>>n;

    for(int i=0; i<k; i++)
    {
        cin>>p[i];
    }

    unsigned int prev = 0;
    s.insert(1);
    while(*s.begin() < n)
    {
        // cout<<prev<<endl;
        unsigned int f = *s.begin();
        for(int i=0; i<k; i++)
            s.insert( p[i]*f );
        prev = f;
        s.erase( s.begin() );
    }

    cout<<prev;


    return 0;
}