#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
#include <set>
#include <iostream>
#include <map>
#include <functional>
#include <cstdlib>
#include <numeric>
#include <queue>
#include <complex>
#include <sstream>
#include <stack>

using namespace std;

#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef complex<double> Point;

const float INF = 1e7;
const float EPS = 1e-7;

int main()
{
	int L;
	float dp[1<<12][12];
	while(scanf("%d", &L) != EOF){
		char c;
		vi rs;
		while(scanf("%c", &c), c==' '){
			int r;
			scanf("%d", &r);
			rs.push_back(r);
		}
		int n = rs.size();
		
		rep(i, 1<<n) rep(j, n)
			dp[i][j] = INF;
		rep(i, n){
			dp[1<<i][i] = rs[i]*2.0f;
		}
		rep(i, 1<<n){
			rep(j, n){
				if(!(i&(1<<j)))
					continue;
				rep(k, n){
					if(j == k || !(i&(1<<k)))
						continue;
					dp[i][j] = min(dp[i][j], dp[i^(1<<j)][k] + 2.0f*(float)sqrt(rs[j]*rs[k])+rs[j]-rs[k]);
				}
			}
		}
		
		float best = INF;
		rep(i, n)
			best = min(best, dp[(1<<n)-1][i]);
		puts(best-EPS < L ? "OK" : "NA");
	}
	
	return 0;
}