#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define INF (1<<29)
#define EPS (1e-8)

double calc(int *tmp, int n) {
	double sum = tmp[0] + tmp[n - 1];
	FOR(i, 1, n) {
		sum += sqrt(pow(tmp[i] + tmp[i - 1], 2) - pow(abs(tmp[i] - tmp[i - 1]), 2));
	}
	return sum;
}

int main() {
	string str;
	while (getline(cin, str)) {
		istringstream is(str);
		int n = count(str.c_str(), str.c_str() + str.size(), ' ');
		int w, r[10];
		is >> w;
		REP(i, n) is >> r[i];
		
		sort(r, r + n);
		
		double ans = INF;
		REP(i, 2) {
			int R = n - 1, L = 0;
			bool f = i & 1;
			
			int tmp[10];
			REP(j, n) {
				if (f) tmp[j] = r[R--];
				else tmp[j] = r[L++];
				f = !f;
			}
			ans = min(ans, calc(tmp, n));
		}
		if ((double)w >= ans) puts("OK");
		else puts("NA");
	}
	
	return 0;
}