#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template<typename T>inline
#define TTF_ template<typename T,typename F>inline
TT_ T sq(T x){return x*x;}
TT_ T In(){T x;cin>>x;return x;}
TT_ void Out(T&x){cout<<x;}
TT_ void sort(T&v){sort(begin(v),end(v));}
TT_ void revs(T&v){reverse(begin(v),end(v));}
TT_ void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT_ int ubnd(T&v,typename T::value_type&x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT_ int lbnd(T&v,typename T::value_type&x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF_ void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF_ void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
TT_ typename T::iterator minel(T&v){return min_element(begin(v),end(v));}
TT_ typename T::iterator maxel(T&v){return max_element(begin(v),end(v));}

inline void fast_io(){ios::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}
//}}} priority_queue queue deque front stringstream max_element min_element insert count make_tuple

deque<int> split(const string& s)
{
  deque<int> r;
  stringstream ss(s);
  string token;
  while (getline(ss, token, ' ')){
    r.emplace_back(atoi(token.c_str()));
  }
  return r;
}

struct Solver {
  Solver(const string& s){
    R = split(s);
    L = R[0];
    R.pop_front();
    N = R.size();
  }
  bool solve(){
    for (int i = 0; i < (1 << N); i++){
      for (int j = 0; j < N; j++){
        dp[i][j] = 1e9;
      }
    }

    for (int i = 0; i < N; i++){
      dp[1 << i][i] = R[i] * 2;
    }
    for (int i = 0; i < (1 << N); i++){
      for (int j = 0; j < N; j++){
        if (dp[i][j] > 1e8) continue;
        for (int k = 0; k < N; k++){
          if ((i >> k) & 1) continue;
          dp[i | (1 << k)][k] = min(dp[i | (1 << k)][k], dp[i][j] + calc_add_dist(j, k));
        }
      }
    }
    ld mini = 1e9;
    for (int i = 0; i < N; i++){
      mini = min(dp[(1 << N) - 1][i], mini);
    }
    return (ld)L + 1e-9 > mini;
  }
  ld calc_add_dist(int a, int b){
    ld x = sqrt(sq(R[a] + R[b]) - sq(R[a] - R[b]));
    return R[b] + x - R[a];
  }
  deque<int> R;
  int L, N;
  ld dp[1 << 12][12];
};

int main()
{
  string line;
  while (getline(cin, line)){
    Solver sol(line);
    if (sol.solve()) puts("OK");
    else puts("NA");
  }

  return 0;
}