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
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
// Artur Kraska, II UWr

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <queue>
#include <list>
#include <set>
#include <map>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(suto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define deb(X)                      X;

#define M 2000000007ll
#define M2 1000000000000000007ll
#define INF 1000000007
#define EPS 0.001

using namespace std;

vector <unsigned int> v0, vv;
long long n=1000000000000000000ll, k=25, res;
long long p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
long long MAX_SIZE0 = 1100007, size=0;

void generuj(int pocz, int minn)
{
    //v0.clear();
    if(v0.size() != MAX_SIZE0)
        v0.resize(MAX_SIZE0);
    size = 0;
	v0[size++] = 1;

//	cout << "rusza " << pocz << ", " << minn << endl;

	long long L = (sqrt(n)+100)*sqrt((long double)minn)+1;
//	cout << "dla " << pocz << " mamy L=" << L << endl;

	FOR(i, pocz, k-1)
	{
	    for(long long pp = p[i]; pp < L; pp *= pp)
        {
//            cout << "teraz idzie " << pp << endl;
            int kon = size;
            forr(j, kon)
            {
                if(v0[j]*pp < L)
                {
                    v0[size++] = v0[j]*pp;
//                    cout << "doklada " << v0[j]*pp << endl;
                }
            }
//            cout << "i: " << i << "  size: " << size << endl;
        }
	}

//	cout << "koncowy rozmiar: " << size << endl;
	sort(v0.begin(), v0.begin()+size);
}

void sprawdzaj(long long b)
{
/*    cout << "v: ";
    FOR(i, 0, size-1)
        cout << v0[i] << " ";
    cout << endl;*/
    int poz = size-1;
    FOR(i, 0, size-1)
    {
        while(poz > 0 && b*(long double)v0[i]*v0[poz] > n)// + EPS)
            poz--;
//        cout << b << " " << v0[i] << " " << v0[poz] << " -> " << b*(long double)v0[i]*v0[poz] << endl;
        if(b*(long double)v0[i]*v0[poz] <= n)// + EPS)
            res = max(res, b*v0[i]*v0[poz]);
    }
}

void dzialaj()
{
    vv.PB(1);
	FOR(i, 0, k-1)
	{
	    vv.PB(p[i]);
	    continue;
	    for(long long pp = p[i]; pp < 100; pp *= pp)
        {
            int kon = vv.size();
            forr(j, kon)
            {
                if(vv[j]*pp < 100)
                    vv.PB(vv[j]*pp);
            }
        }
	}
//	cout << "vv ma " << vv.size() << " elementow" << endl;


    int pocz = 0;
    if(p[0] == 2 && k > 16)
    {
        generuj(1, 1);

        for(long long pp = 1; pp <= n; pp *= 2)
            sprawdzaj(pp);

        FOR(x, 0, k-1)
            for(long long pp = p[x], il=0; pp <= n && il <= 6; pp *= 2, il++)
                sprawdzaj(pp);

        //FOREACH(it, vv)
        //    sprawdzaj(*it);

        pocz = 1;
    }
    else //FOR(i, pocz, pocz) //k-1)
    {
        generuj(0, 1);//p[i]*2);
        FOREACH(it, vv)
            sprawdzaj(*it);
    }
}

int main()
{
//    scanf("%lld", &n);
//    dzialaj();

///*
    res = 0;
    scanf("%lld %lld", &k, &n);
    forr(i, k)
        scanf("%lld", &p[i]);
    sort(p, p+k);
//    FOR(i, 0, k-1)
//        cout << p[i] << endl;
//*/
    dzialaj();

    printf("%lld\n", res);

	return 0;
}

/*
int n, a, tab[300007], res;
long long p2[] = {2, 97, 3, 89, 5, 83, 7, 79, 11, 73, 13, 71, 17, 67, 19, 61, 23, 59, 29, 53, 31, 47, 37, 43, 41};
set <long long> S, S1, S2;
vector <pair<int, int> > v;
priority_queue <pair<long long, int> > pq;

int reszta()
{

	S.insert(1);
	FOR(i, 13, 24)
	{
		cout << "teraz idzie " << p2[i] << endl;
		FOREACH(it, S)
		{
			if(*it*p2[i] > M2)
                break;
            S.insert(*it*p2[i]);
		}
		cout << "  size: " << S.size() << endl;
	}

    S1.insert(1);
    S2.insert(1);
	FOR(i, 0, 24)
	{
	    if(S1.size() < S2.size())
        {
            cout << "teraz idzie " << p[i] <<  " do S1" << endl;
            FOREACH(it, S1)
            {
                if(*it*p[i] > M2)
                    break;
                S1.insert(*it*p[i]);
            }
            cout << "  S1 size: " << S1.size() << endl;
        }
        else
        {
            cout << "teraz idzie " << p[i] << " do S2" << endl;
            FOREACH(it, S2)
            {
                if(*it*p[i] > M2)
                    break;
                S2.insert(*it*p[i]);
            }
            cout << "  S2 size: " << S2.size() << endl;
        }
	}


	int ile = 0, pier = 25, maks = 0, prog=2;
	*//*v.PB(MP(1, 0));
	forr(i, v.size())
	{
		*//*if(v[i].first >= prog)
		{
			v.erase(v.begin(), v.begin()+i);

			cout << "prog: " << prog << ", ile: " << ile << endl;
			prog *= 2;
			sort( v.begin(), v.end() );
			//v.erase( unique( v.begin(), v.end() ), v.end() );
			i = 0;
		}*//*
		ile++;
		FOR(j, v[i].second, pier-1)
		{
			if(v[i].first*p[j] < M)
				v.PB(MP(v[i].first*p[j], j));
		}
		maks = max(maks, (int)v.size() - i);
	}
	sort(v.begin(), v.end());
	*/
/*	pq.push(MP(-1, 0));
	long long last = 0, diff = 0;
	while(!pq.empty())
	{
		ile++;
		//cout << "top: " << -pq.top().first << ", " << pq.top().second << endl;
		FOR(j, pq.top().second, pier-1)
		{
			if(-pq.top().first*p[j] < M)
			{
				pq.push(MP(pq.top().first*p[j], j));
				//cout << "   doklada " << pq.top().first*p[j] << " " <<  j << endl;
			}
		}
		maks = max(maks, (int)pq.size());
		diff = max(diff, -pq.top().first - last);
		last = -pq.top().first;
		pq.pop();
	}

	*//*int diff = 0;
	FOR(i, 1, v.size()-1)
	{
		diff = max(diff, v[i].first-v[i-1].first);
	}*/
/*	cout << "diff: " << diff << endl;
	cout << "ile: " << ile << ", maks: " << maks << endl;


    return 0;
}*/