#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;

#define MAX_N 12
#define EPS 1e-7

double boxlen;
int n;
double r[MAX_N];
double dp[MAX_N][1 << MAX_N];

double sq(double x){
	return x * x;
}

double dist(int i, int j){
	return sqrt(sq(r[i] + r[j]) - sq(r[i] - r[j]));
}

void solve(){
	double INF = 1e99;

	for(int S = 0; S < (1 << n); ++S){
		for(int i = 0; i < n; ++i){
			dp[i][S] = INF;
		}
	}

	for(int i = 0; i < n; ++i){
		dp[i][1 << i] = r[i];
	}

	for(int S = 0; S < (1 << n); ++S){
		for(int i = 0; i < n; ++i){
			if(((S >> i) & 1) != 0){
				for(int j = 0; j < n; ++j){
					if(((S >> j) & 1) == 0){
						int next = S | (1 << j);
						dp[j][next] = min(dp[j][next], dp[i][S] + dist(i, j));
					}
				}
			}
		}
	}

	double minlen = INF;
	for(int i = 0; i < n; ++i){
		minlen = min(minlen, dp[i][(1 << n) - 1] + r[i]);
	}

	if(minlen < boxlen + EPS){
		printf("OK\n");
	}
	else{
		printf("NA\n");
	}
}

int main(){
	while(scanf("%lf", &boxlen) != EOF){
		n = 0;
		char nextch = ' ';
		while(nextch == ' '){
			scanf("%lf%c", &r[n], &nextch);
			++n;
		}
		solve();
	}
}