#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) REP(i, 0, n)
int main()
{
    int a[12];
    char b[256];
    while (fgets(b, 256, stdin)) {
        char* p = strtok(b, " ");
        int L = atoi(p);
        int n = 0;
        while (p = strtok(NULL, " ")) a[n++] = atoi(p);

        bool ok = false;
        std::sort(a, a+n);
        do {
            double t = a[0];
            REP(i, 1, n) {
                int r1 = a[i-1];
                int r2 = a[i];
                if (r1 < r2) std::swap(r1, r2);
                t += 2 * sqrt(r1 * r2);
            }
            t += a[n-1];
            if (!(t > L)) { ok = true; break; }
        } while (std::next_permutation(a, a+n));

        puts(ok ? "OK" : "NA");
    }
    return 0;
}