#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
char I[300],*p;
int R[15],B,N,i,j,k,a[2][15];


double ch(int *r)
{
	int i;
	double l=0;
	for(i=0;i<N-1;i++)
	{
		int a=pow((double)r[i]+r[i+1],2);
		int b=pow((double)abs(r[i]-r[i+1]),2);

		l+=sqrt((double)(a-b));
	}
	return pow(l+r[0]+r[N-1],2);
}

int main()
{
	for(;gets(I);)
	{
		p=strtok(I," ");
		B=atoi(p);
		B*=B;
		for(N=0;(p=strtok(NULL," "))!=NULL;)
			R[N++]=atoi(p);
		sort(R,R+N);
		for(i=j=0,k=N-1;i<=k;j++)
		{
			if(j%2)a[0][j]=R[i++];
			else a[0][j]=R[k--];
		}
		for(i=j=0,k=N-1;i<=k;j++)
		{
			if(!(j%2))a[1][j]=R[i++];
			else a[1][j]=R[k--];
		}
		puts(B>=ch(a[0])||B>=ch(a[1])?"OK":"NA");
	}
}