#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define INF (1<<28)

double g[13][13];
double dp[1<<13][13];

int main() {
	string str;
	while (getline(cin, str)) {
		istringstream is(str);
		int n = count(str.c_str(), str.c_str() + str.size(), ' ');
		int w, r[12];
		is >> w;
		REP(i, n) is >> r[i];
		
		REP(i, n) {
			g[0][i + 1] = r[i];
			g[i + 1][0] = r[i];
		}
		REP(i, n) REP(j, n) {
			if (i == j) g[i + 1][j + 1] = 0.0;
			else g[i + 1][j + 1] = sqrt(pow(r[i] + r[j], 2) - pow(r[i] - r[j], 2));
		}
		
		n++;
		fill(dp[0], dp[1<<n], INF);
		dp[1][0] = 0;
		
		REP(i, 1<<n) {
			REP(j, n) {
				if (dp[i][j] == INF) continue;
				
				REP(k, n) {
					if ((i >> k) & 1) continue;
					int next = i | (1 << k);
					
					dp[next][k] = min(dp[next][k], dp[i][j] + g[j][k]);
				}
			}
		}
		
		double ans = INF;
		REP(i, n) if (dp[(1 << n) - 1][i] != INF) ans = min(ans, dp[(1 << n) - 1][i] + g[i][0]);
		
		if ((double)w >= ans) puts("OK");
		else puts("NA");
	}
	
	return 0;
}