#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

const double EPS = 1e-10;

main(){
  int L;
  int data[12];
  while(cin >> L){
    int size;
    for(size=0;;size++){
      char c;
      scanf("%d%c", &data[size], &c);
      if(c == '\n'){
	size++;
	break;
      }
    }
    double len[12][12];
    for(int i=0;i<size;i++){
      for(int j=0;j<size;j++){
	int a = abs(data[i] - data[j]);
	int b = data[i] + data[j];
	len[i][j] = sqrt((double)(b*b) - (double)(a*a));
      }
    }
    /*for(int i=0;i<size;i++){
      for(int j=0;j<size;j++){
	cout << len[i][j] << ' ';
      }
      cout << endl;
      }*/
    double dp[1<<12][12];
    fill(dp[0], dp[1<<12], 100000.0);
    for(int i=0;i<size;i++){
      dp[1<<i][i] = (double)(data[i]*2);
    }
    for(int i=0;i<(1<<size);i++){
      for(int j=0;j<size;j++){
	if(dp[i][j]<0.0 || dp[i][j]-EPS > L) continue;
	for(int k=0;k<size;k++){
	  if(i & 1<<k) continue;
	  dp[i | 1<<k][k] = min(dp[i | 1<<k][k], dp[i][j] - (double)data[j] + (double)len[j][k] + (double)data[k]);
	}
      }
    }
    /*for(int i=0;i<(1<<size);i++){
      for(int j=0;j<size;j++){
	cout << dp[i][j] << ' ' ;
      }
      cout << endl;
      }*/
    bool f = false;
    for(int i=0;i<size;i++){
      double tmp = dp[(1<<size)-1][i];
      if(tmp < 0.0) continue;
      if(tmp < L || abs(tmp - L) < EPS){
	f = true;
	//cout << tmp << endl;
	break;
      }
    }
    if(f) cout << "OK" << endl;
    else cout << "NA" << endl;
  }
  return 0;
}