#include<iostream>
#include<sstream>
#include<cmath>
#include<algorithm>
using namespace std;


int main(){
	string s;
	int size;
	int r[12];
	int n;
	while(getline(cin,s)){
		int perm[]={0,1,2,3,4,5,6,7,8,9,10,11};	
		stringstream ss;
		ss<<s;
		ss>>size;
		n=0;
		while(ss>>r[n])n++;
		bool ok=false;
		do{
			double w;
			w=r[perm[0]];
			for(int i=1;i<n;i++)w+=2*sqrt(r[perm[i-1]]*r[perm[i]]);
			if(1<n)w+=r[perm[n-1]];
			if(w<=size){
				ok=true;
				break;
			}
		}while(next_permutation(perm,perm+n));
		cout<<(ok?"OK":"NA")<<endl;
	}
	return 0;
}