Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
	)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		n, _ := strconv.Atoi(buf[0])
		x, _ := strconv.Atoi(buf[1])
		prime_table := make([]int, 1000001)
		prime_table[0] = -1
		prime_table[1] = -1
		for i := 2; i < 1000001; i++ {
			if ^prime_table[i] != 0 {
				prime_table[i] = 1
				for j := 2*i; j < 1000001; j += i {
					prime_table[j] = -1 // -1 means "not prime"
				}
			}
		}
		dp := make([]int, x+1)
		dp[0] = 1
		menu := make([]int, n)
		for i := 0; i < n; i++ {
			scanner.Scan()
			menu[i], _ = strconv.Atoi(scanner.Text())
		}
		for i := 0; i < n; i++ {
			for j := 0; j <= x; j++ {
				if menu[i] <= j && dp[j-menu[i]] != 0 {
					// log.Println(dp)
					dp[j] = 1
				}
			}
		}
		flag := true
		for j := x; j >= 0; j-- {
			if prime_table[j] == 1 && dp[j] == 1 {
				flag = false
				fmt.Println(j)
				break
			}
		}
		if flag {
			fmt.Println("NA")
		}
	}
}

C++: #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <sstream>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <iterator>
#include <stack>
#include <list>
using namespace std;
#define INF 100000000
typedef long long int lli;
typedef pair<int,int> P;
bool dp[30][1000001];
bool pn[1000001];

void eratos(bool f[]){
	for(int i=0; i<1000001; ++i){
		f[i]=true;
	}
	pn[0]=false;
	pn[1]=false;
	for(int i=2; i*i<1000001; ++i){
		if(f[i]){
			for(int j=2; i*j<1000001; ++j){
				f[i*j]=false;
			}
		}
	}
}
int main(){
	int n,x;
	eratos(pn);
	while(cin >> n >> x){
		if(n==0&&x==0) break;
		vector<int> cost(n);
		for(int i=0; i<n; ++i){
			cin >> cost[i];
		}
		for(int i=0; i<n; ++i){
			for(int j=0; j<=x; ++j){
				dp[i][j]=false;
			}
		}
		for(int i=0; i*cost[0]<=x; ++i){
			dp[0][cost[0]*i]=true;
		}
		for(int i=1; i<n; ++i){
			for(int j=0; j<=x; ++j){
				if(dp[i-1][j]){
					for(int k=0;j+cost[i]*k<=x; ){
						dp[i][j+cost[i]*k]=true;
						++k;
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						if(j+cost[i]*k<=x){
							dp[i][j+cost[i]*k]=true;
							++k;
						}
						
					}
				}
			}
		}
		bool flag=false;
		int ans;
		for(int i=x; i>=0; --i){
			if(dp[n-1][i]&&pn[i]){
				flag=true;
				ans=i;
				break;
			}
		}
		if(flag) {
			cout << ans << "\n";
		} else {
			cout << "NA\n";
		}
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };

static int dp[ 1000001 ];
static bool is_pm[ 1000001 ];
static int n, m;
static VI _array;

int solve( int now, int many ) {
	if ( dp[ many ] >= 0 ) {
		return dp[ many ];
	}
	if ( now == n ) {
		if ( is_pm[ many ] ) {
			return dp[many] = many;
		}
		return dp[many] = 0;
	}
	int res = 0;
	for ( int i = 0; many + _array[ now ] * i <= m; i++ ) {
		res = max( res, solve( now + 1, many + _array[ now ] * i ) );
	}
	return dp[ many ] = res;
}

int main() {
	NCLR( is_pm );
	for ( int i = 2; sq( i ) <= 1000000; i += 2 ) {
		if ( is_pm[ i ] ) {
			for ( int j = i * i; j <= 1000000; j += i ) {
				is_pm[ j ] = false;
				if ( i != 2 ) {
					j += i;
				}
			}
		}
		if ( i == 2 ) {
			--i;
		}
	}
	is_pm[ 0 ] = is_pm[ 1 ] = false;
	while ( ~scanf( "%d %d", &n, &m ) && n && m ) {
		_array.resize( n );
		for ( int i = 0; i < n; i++ ) {
			scanf( "%d", &_array[ i ] );
		}
		sort( _array.rbegin(), _array.rend() );
		_array.erase( unique( _array.begin(), _array.end() ), _array.end() );
		n = _array.size();
		NCLR( dp );
		int ans = solve( 0, 0 );
		if ( ans ) {
			printf( "%d\n", ans );
		}
		else {
			printf( "NA\n" );
		}
	}
	return 0;
}