#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    string s;
    while(getline(cin, s)){
        vector<int> v{0};
        for (auto &&i : s) {
            if(i == ' ') v.emplace_back(0);
            else v.back() = v.back()*10+i-'0';
        }
        int W = v.front();
        int n = v.size()-1;
        vector<int> A(v.begin()+1,v.end());
        auto dp = make_v(n, 1 << n, 1e12);
        for (int i = 0; i < n; ++i) {
            dp[i][1 << i] = A[i];
        }
        for (int j = 0; j < (1 << n); ++j) {
            for (int i = 0; i < n; ++i) {
                for (int k = 0; k < n; ++k) {
                    if(!(j & (1 << k))){
                        chmin(dp[k][j^(1 << k)], dp[i][j]+2*sqrt(A[i]*A[k]));
                    }
                }
            }
        }
        int ok = 0;
        for (int i = 0; i < n; ++i) {
            if(dp[i].back()+A[i] <= W+1e-10) ok = 1;
        }
        puts(ok ? "OK" : "NA");
    }
    return 0;
}
