#include <iostream>
#include <vector>
#include <cmath>
#include <sstream>
#include <algorithm>
using namespace std;

#define EPS 1e-8

double between(double r1, double r2) {
    return sqrt((r1+r2)*(r1+r2)-(r1-r2)*(r1-r2));
}

bool solve(int l, vector<int> rs) {
    double total_length = *rs.begin() + *(rs.end()-1);
    for (int i = 1; i < rs.size(); i++) {
        total_length += between(rs[i-1], rs[i]);
//        cout << between(rs[i-1], rs[i]) << endl;;
    }
//    cout << total_length << endl;
    if ( total_length < l + EPS ) {
        return true;
    } else {
        return false;
    }
}

int main() {
    int l;
    vector<int> rs;
    string s;
    while (getline(cin, s)) {
        rs.clear();
        istringstream iss(s);
        iss >> l;
        int r;
        while (iss >> r) {
            rs.push_back(r);
        }
        bool possible = false;
        sort(rs.begin(), rs.end());
        do {
            if (solve(l, rs)) possible = true;
        } while (next_permutation(rs.begin(), rs.end()));
        if (possible) {
            cout << "OK" << endl;
        } else {
            cout << "NA" << endl;
        }
        s.clear();
    }
    return 0;
}

        