Codeforces 912E-Prime Gift

Prime Gift

time limit per test

3.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Opposite to Grisha's nice behavior, Oleg, though he has an entire year at his disposal, didn't manage to learn how to solve number theory problems in the past year. That's why instead of Ded Moroz he was visited by his teammate Andrew, who solemnly presented him with a set of n distinct prime numbers alongside with a simple task: Oleg is to find the k-th smallest integer, such that all its prime divisors are in this set.

Input

The first line contains a single integer n (1 ≤ n ≤ 16).

The next line lists n distinct prime numbers p1, p2, ..., pn (2 ≤ pi ≤ 100) in ascending order.

The last line gives a single integer k (1 ≤ k). It is guaranteed that the k-th smallest integer such that all its prime divisors are in this set does not exceed 1018.

Output

Print a single line featuring the k-th smallest integer. It's guaranteed that the answer doesn't exceed 1018.

Examples

input

3
2 3 5
7

output

8

input

5
3 7 11 13 31
17

output

93

Note

The list of numbers with all prime divisors inside {2, 3, 5} begins as follows:

(1, 2, 3, 4, 5, 6, 8, ...)

The seventh number in this list (1-indexed) is eight.

题意：给你n个质数，问因子中只包含这其中几个质数的第k大的数是多少

解题思路：可以将n个质数的集合分为两个集合，用这两个集合分别生成小于1e18的积，然后二分答案+验证。在拆分n个质数的集合时可以奇数位的放在一个集合，偶数位的放在一个集合，这样生成小于1e18的积可以更快

#include <iostream>    
#include <cstdio>    
#include <cstring>    
#include <string>    
#include <algorithm>    
#include <map>    
#include <set>    
#include <stack>    
#include <queue>    
#include <vector>    
#include <bitset>    
#include <functional>    

using namespace std;

#define LL long long    
const LL INF = 1e18;

vector<LL>g[2];
int n, Size1, Size2;
LL a[20], k, b[20];

void dfs(int k, int x, int y, LL mul)
{
	g[k].push_back(mul);
	for (int i = x; i <= y; i++)
		if (INF / b[i] >= mul) dfs(k, i, y, mul*b[i]);
}

int check(LL mid)
{
	LL sum = 0;
	for (int i = 0; i < Size1&&g[0][i] <= mid; i++)
	{
		LL tmp = mid / g[0][i];
		int p = upper_bound(g[1].begin(), g[1].end(),tmp) - g[1].begin() - 1;
		sum += p + 1;
	}
	return sum >= k;
}

int main()
{
	while (~scanf("%d", &n))
	{
		for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
		scanf("%lld", &k);
		for (int i = 0; i < 2; i++) g[i].clear();
		int cnt = 1;
		for (int i = 1; i <= n; i++)
			if (i & 1) b[cnt++] = a[i];
		dfs(0, 1, cnt - 1, 1);
		cnt = 1;
		for (int i = 1; i <= n; i++)
			if (i % 2 == 0) b[cnt++] = a[i];
		dfs(1, 1, cnt - 1, 1);
		for (int i = 0; i < 2; i++) sort(g[i].begin(), g[i].end());
		Size1 = g[0].size();
		Size2 = g[1].size();
		LL l = 1, r = INF, ans;
		while (l <= r)
		{
			LL mid = (l + r) >> 1;
			if (check(mid)) { ans = mid; r = mid - 1; }
			else l = mid + 1;
		}
		printf("%lld\n", ans);
	}
	return 0;
}