#include <bits/stdc++.h>
using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) begin(r),end(r)
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)
#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init))
#define mp(a,b) make_pair(a,b)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

using ll = long long;
using pii = pair<int,int> ;
using pll = pair<ll,ll> ;
using pdl = pair<double,ll> ;

const int mod = 1000000007;
constexpr int inf = ((1<<30)-1)*2+1 ;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0,1,-1,1,-1};
const int dx[] = {0,-1,0,1,1,-1,-1,1};

inline bool value(int x,int y,int w,int h){
  return (x >= 0 && x < w && y >= 0 && y < h);
}
double add(double a, double b){
  if(abs(a+b) < eps* (abs(a) + abs(b))) return 0;
  return a+b;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  string s;
  stringstream ss;
  ll w;
  while(getline(cin,s)){
    ss.clear();
    ss << s;
    ss >> w;
    vector<ll> v(12);
    ll n = 0,k;
    while(ss >> k){
      v[n] = k;
      ++n;
    }
    vector<vector<double>> dp(1 << n,vector<double>(n,0));
    bool f = false;
    rep(i,n){
      dp[1 << i][i] = v[i];
    }
    rep(bfr,(1 << n)){
      REP(now,0,n){
        if((bfr & (1 << now)) == 0) continue;
        REP(nxt,0,n){
          if((bfr & (1 << nxt)) == 0){
            double bw = dp[bfr][now];
            int bn = now;
            if(bfr == 0 || (bfr|(1 << nxt)) == (1 << n)-1){
              bw = add(bw,v[nxt]);
            }
            if(bfr != 0){
              ll h = v[bn]+v[nxt],s = v[bn] - v[nxt];
              bw = add(bw , sqrt(h*h - s*s));
            }
            if(dp[bfr|( 1 << nxt)][nxt] != 0)
              dp[bfr|( 1 << nxt)][nxt] = min(dp[bfr|( 1 << nxt)][nxt],bw);
            else
              dp[bfr|( 1 << nxt)][nxt] = bw;
            if((bfr|(1 << nxt)) == (1 << n)-1 && w - bw >= 0){
              f = true;
            }
          }
        }
      }
    }
    if(f){
      cout << "OK" << endl;
    }
    else{
      cout << "NA"<<endl;
    }
  }
  return 0;
}