Problem: Taro Aizu's company has a boss who hates being indivisible. When Taro goes out to eat with his boss, he pays by splitting the bill, but when the payment amount is not divisible by the number of participants, his boss always pays for it.

One day, Taro became the secretary of the dinner party. Mr. Taro, who has little money, wondered if he could invite his boss to get a treat. I have to place an order with a restaurant, but I don't know how many people will participate yet, so it seems that I want to place an order so that any number of people can participate. At the same time as Mr. Taro, you who are also planning to attend the dinner party decided to cooperate with Mr. Taro to calculate the amount that is less than the budget amount and is not divisible by any number of people.

Create a program that inputs the type of dish, the price of each dish, and the budget amount, and outputs the total amount (excluding 1 and the total amount) that is not divisible by any number that is less than or equal to the budget amount. You can order multiple dishes of each type, but you do not have to order all types of dishes. However, if there is no such total amount, output NA.



Input

A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. Each dataset is given in the following format:


n x
v1
v2
::
vn


On the first line, the type of dish n (1 ≤ n ≤ 30) and the budget amount x (1 ≤ x ≤ 1000000) are given, separated by blanks. The next n lines are given the integer vi (1 ≤ vi ≤ 1000000), which represents the amount of the i-type dish.

The number of datasets does not exceed 100.

Output

For each input dataset, print the total amount or NA closest to the budget amount on one line.

Example

Input

4 15000
305
260
129
500
3 400
10
20
30
3 200909
5
9
12
0 0


Output

14983
NA
200909

Solution (in CPP):

Solution:
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

const int MAX_N = 30;
const int MAX_X = 1000000 + 1;

int kin[MAX_N];
bool dp[MAX_X];

bool isPrime ( int n )
{
	for (int i = 2; i*i <= n; ++i) {
		if (n % i == 0) return false;
	}
	return n >= 2;
}

int main ( void )
{
	vector<int> prime;
	prime.push_back(2);
	for (int i = 3; i < MAX_X; i+=2) {
		if (isPrime(i)) { prime.push_back(i); }
	}

	int n, x;

	while (cin >> n >> x, n | x) {
		fill(dp, dp+x, false);
		for (int i = 0; i < n; ++i) {
			cin >> kin[i];
		}

		dp[0] = true;
		for (int i = 0; i < x; ++i) {
			if (!dp[i]) { continue; }
			for (int j = 0; j < n; ++j) {
				if (i+kin[j] <= x) {
					dp[i+kin[j]] = true;
				}
			}
		}

		int ans;
		for (ans = x; ans >= 0; --ans) {
			if (dp[ans] && binary_search(prime.begin(), prime.end(), ans)) {
				break;
			}
		}

		if (ans < 0)
			cout << "NA" << endl;
		else
			cout << ans << endl;
	}

	return 0;
}