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

int n,l;
char len[1111];
int r[22];

double dp[22][5555];

double sq(int a){return a*a;}

double solve(int af,int used){
  if(dp[af][used] >= 0) return dp[af][used];

  if(used == (1<<n)-1) return 0;

  double ret = 4444;
  for(int i = 0; i < n; i++){
    if(af == n) r[af] = r[i];
    if( (used & (1<<i)) == 0 ){
      ret = min(ret, solve(i, used | (1<<i)) + sqrt(sq(r[i] + r[af]) - sq(r[i] - r[af])) - r[af] + r[i]);
    }
  }
  return dp[af][used] = ret;
}


int main(void)
{
  while( fgets(len, sizeof(len), stdin) != NULL ){
    n=0;

    vector<char*> d;
    for(int i = 0; len[i] != '\0'; i++){
      if(len[i] == ' '){
	d.push_back(len+i+1);
	n++;
      }
    }
    sscanf(len,"%d",&l);
    for(int i = 0; i < n; i++){
      sscanf(d[i],"%d",&r[i]);
    }

    for(int i = 0; i <= n; i++){
      for(int j = 0; j < 5555; j++){
	dp[i][j] = -1;
      }
    }
    double ret = solve(n,0);
    if(ret > l) puts("NA");
    else puts("OK"); 
  }
}