// ?????¬???????????¬??????

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;
constexpr double EPS = 1e-8;

double dp[1 << 12][12];

signed main() {
    string s;
    while(getline(cin, s)) {
        double W;
        stringstream ss(s);
        ss >> W;

        vector<int> v;
        int N, val;
        while(ss >> val) {
            v.push_back(val);
        }

        N = v.size();
        rep(i,0,1<<N) rep(j,0,N) dp[i][j] = INF;
        dp[0][0] = 0;

        rep(bit,0,1<<N) rep(i,0,N) {
            if(dp[bit][i] == INF) continue;
            rep(k,0,N) {
                if(bit >> k & 1) continue;
                int nbit = bit | (1 << k);
                if(__builtin_popcount(nbit) == 1) {
                    dp[nbit][k] = v[k] * 2;
                }
                else {
                    chmin(dp[nbit][k], dp[bit][i] + 2 * sqrt(v[i] * v[k]) - v[i] + v[k]);
                }
            }
        }

        bool ok = false;
        rep(i,0,N) {
            if(dp[(1<<N)-1][i] <= W + EPS) {
                cout << "OK" << endl;
                ok = true;
                break;
            }
        }
        if(!ok) cout << "NA" << endl;
    }
    return 0;
}