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

#define MAX 12


bool solve(int p[], int n, int w, int r[]){
	/*
		High Speed but not alphameric order.
		genperm1 from http://www5.airnet.ne.jp/tomy/cpro/pe1.htm (C) Tomy
	*/
	double tw;
	int *c,*pc,*q,k,t;

	c = new int[n];
	for(k=1,q=p,pc=c;k<=n;)*q++=*pc++=k++;k=1;pc=c;
	do{t=*(p+k);*(p+k)=*(q=p+((k&1)?*pc:0));*q=t;
	
	//TODO
	tw = r[-2]+2.0*sqrt((double)r[-2]*r[p[0]-1]);
	for(int i = 0; i < n-1; i++){
		tw += (double)2*sqrt((double)r[p[i]-1]*r[p[i+1]-1]);
	}
	tw += 2.0*sqrt((double)r[-1]*r[p[n-1]-1])+r[-1];
	if( tw <= w ){
		//cout << tw << endl;
		delete [] c;
		return true;
	}
	
	k=1;pc = c;while(*pc==0)*pc++=k++;(*pc)--;}while(k<n);

	delete [] c;
	return false;
}

int main(void){
	while(true){
		int w;
		int num = 0;
		int perm[MAX];
		int r[MAX];
		
		cin >> w;
		if( cin.eof() ) break;
		while( true ){ cin >> r[num]; num++; if( '\n' == cin.get() ) break; }

		sort(r,r+num);

		if( solve(perm, num-2, w, r+2) ){
			cout << "OK\n";
		}else{
			cout << "NA\n";
		}	
	}
	return 0;
}