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] != -1 {
				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")
		}
	}
}

Python: def sieve():
    n = 1000001
    p = [1] * n
    p[0] = p[1] = 0
    
    for i in range(int(n ** 0.5)):
        if p[i]:
            for j in range(2 * i, len(p), i):
                p[j] = 0
    return p

def solve(p, menu, x):
    menu.sort(reverse=True)
    
    num = [0] * (x + 1)
    for i in range(0,len(num),menu[-1]):
        num[i] = 1
    for mi in menu[:-1]:
        for i in range(len(num) - mi):
            if num[i]:
                num[i + mi] = 1
                
    for i in reversed(range(1, len(num))):
        if p[i] and num[i]:
            return i
    return 'NA'

import sys
f = sys.stdin

p = sieve()
while True:
    n, x = map(int, f.readline().split())
    if n == 0:
        break
    menu = [int(f.readline()) for _ in range(n)]
    print(solve(p, menu, x))

Python: from math import sqrt
prime = [1 for _ in xrange(10**6+1)]
prime[1] = 0
prime[0] = 0
for i in xrange(2, int(sqrt(10**6+1))+1):
    if prime[i] == 1:
        for j in xrange(i+i, 10**6+1, i):
            prime[j] = 0
while True:
    N, X = map(int, raw_input().split())
    if (N, X) == (0, 0): break
    price = [input() for _ in xrange(N)]
    dp = [0] * (X+1)
    dp[0] = 1
    for i in xrange(X+1):
        if dp[i] == 0: continue
        for p in price:
            if i + p <= X:
                dp[i+p] = 1
    for i in xrange(X, -1, -1):
        if dp[i] == 1 and prime[i] == 1:
            print(i)
            break
    else:
        print("NA")

Python: input = raw_input

def init():
    table = [True] * 2000001
    table[0] = False
    table[1] = False
    n = len(table)
    for i in range(2, n):
        for j in range(i + i, n, i):
            table[j] = False
    return table
    
def solve(price, ps, is_prime):
    dp = []
    for i in range(len(ps)):
        dp.append([False] * (price + 1))

    dp[0][ps[0]] = True
    dp[0][0]     = True

    for i in range(1, len(ps)):
        for p in range(price + 1):
            if p >= ps[i]:
                dp[i][p] = dp[i - 1][p] or dp[i][p - ps[i]]
            else:
                dp[i][p] = dp[i - 1][p]

    p = -1
    for i in range(0, price + 1):
        if is_prime[i] and dp[len(ps) - 1][i]:
            p = i
    if p == -1:
        print("NA")
    else:
        print(p)
    
def main():
    table = init()
    while True:
        n, price = map(int,input().split())
        if n == 0 and price == 0:
            return
        ps = []
        for i in range(n):
            ps.append(int(input()))
        solve(price, ps, table)

main()

Python: def main():
  tf = [True] * 1000001
  tf[0] = tf[1] = False
  for i in range(2, 1001):
    if tf[i]:
      for j in range(i ** 2 , 1000001, i):
        tf[j] = False
  
  while True:
    n, x = map(int, input().split())
    if n == 0:
      break
    can = [False] * (x + 1)
    can[0] = True
    for _ in range(n):
      v = int(input())
      for i in range(x - v + 1):
        if can[i]: can[i + v] = True
    for i in range(x, -1, -1):
      if can[i] and tf[i]:
        print(i)
        break
    else:
      print("NA")
main()

Python: from bisect import bisect_left as bl
def main():
  tf = [True] * 1000004
  tf[0] = tf[1] = False
  for i in range(2, 1001):
    if tf[i]:
      for j in range(i ** 2 , 1000004, i):
        tf[j] = False
  primes = [i for i in range(1000004) if tf[i]]
  
  while True:
    n, x = map(int, input().split())
    if n == 0:
      break
    can = [False] * (x + 1)
    can[0] = True
    for _ in range(n):
      v = int(input())
      for i in range(x - v + 1):
        can[i + v] = can[i] or can[i + v]
    for i in range(x, -1, -1):
      if tf[i] and can[i]:
        print(i)
        break
    else:
      print("NA")
  
main()

Python: # -*- coding: utf-8 -*-
import pdb
import sys,math,time

#Debug=True
Debug=False
nmax=1000000
#unit_cost = [500,305,260,129]
#total_cost = 15000
#unit_cost = [12,9,5]
#total_cost = 200909
unit_cost = []
total_cost=0
primes=[]
pmax=-1

def ip(f,g):
    s=0
    for i in zip(f,g):
        s += i[0]*i[1]
    return(s)
            
def prime():
    fl = [True for _ in range(nmax+1)]
    yield 2
    yield 3
    k=5
    while k < nmax:
        if fl[k]:
            yield(k)
            for i in range(k+k, nmax+1, k):
                fl[i] = False
        k += 2            

def cost_gen1(money, lvl=0, lst=[]):
    uc = unit_cost[lvl]
    if lvl==len(unit_cost)-1:
        yield uc * math.floor(money/uc)
    else:
        for i in range(int(money/uc),-1,-1):
            tot_uc = uc*i
            rem = money - tot_uc
            if rem < unit_cost[lvl+1]:
                yield tot_uc
            else:
                for j in cost_gen1(rem, lvl+1):
                    yield  j + tot_uc

def check_mutually_prime(v):
    s = min(v)
    for i in range(2,s+1):
        if sum(map(lambda x:x%i, v))==0:
            return False
    return True
    
def main():
    global unit_cost, total_cost, primes, pmax
    if not Debug:
        fh=sys.stdin
    else:
        #fh=open('vol2_0202b.txt', 'r')
        fh=open('vol2_0202.txt', 'r')
        pdb.set_trace()
    if True:
        primes=[x for x in prime() if x<nmax+1]
    else:
        for i in prime():
            primes.append(i)
            if i >= nmax:
                break
    while True:
        m, total_cost = list(map(int, fh.readline().strip().split()))
        if m==0 and total_cost==0:
            break
        v=[]
        for _ in range(m):
            v.append(int(fh.readline()))
        unit_cost = sorted(v, reverse=True)   # 大きい順
        # 互いに素(relative prime)、でないときの処理
        if not check_mutually_prime(unit_cost):
            print('NA')
            continue
        t0=time.time()
        p=[]
        pmax=-1
        gen=cost_gen1(total_cost, 0)
        for i in gen:
            if i > pmax and i in primes:
                p.append(i)
                pmax=max(p)
                if pmax==total_cost:
                    break
        print(max(p))
            
        if Debug:
            print('t=', time.time()-t0)
    fh.close()
	            
if __name__ == "__main__":
    main()