#include<cstdio>
#include<cmath>
#include<vector>
#include<cstring>
#include<cstdlib>

using namespace std;

#define N 12+1
#define INF (1e8)
#define rep(i,j) for(int i=0;i<(j);i++)

double dp[1<<N][N];
int r[N];

double diff(int a,int b){
	if(a*b)return sqrt((r[a]+r[b])*(r[a]+r[b])-(r[a]-r[b])*(r[a]-r[b]));
	return r[a+b];
}

int main(){
	char s[1024];
	int n,w;
	while(NULL != gets(s)){
		w = atoi(s);
		n = 1;
		char *p = strchr(s,' ');
		while(p != NULL){
			r[n++] = atoi(p+1);
			p = strchr(p+1,' ');
		}
		rep(i,1<<n)fill(dp[i],dp[i]+n,INF);
		dp[(1<<n)-1][0] = 0;
		for(int i=(1<<n)-2;i>=0;i--){
			rep(j,n)rep(k,n)
				if(!((i>>k)&1))
					dp[i][j] = min(dp[i][j], dp[i|(1<<k)][k] + diff(j,k));
		}
		puts(dp[0][0]>w?"NA":"OK");
	}
	return 0;
}