#define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cassert>
#include <map>
#include <cassert>
#include <time.h>

using namespace std;

typedef complex<double> xy_t;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int , P> PP;
typedef pair<int, string> Ps;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF= 1 << 30;
const double EPS = 1e-9;
const double PI = 3.1415926535897932384626433832795;

#define rep(i, n) for(int i = 0; i < n; i++)
double r[12];
double dp[12][1 << 12];

int main(){
	int n;
	double b;
	int num;
	string s;
	while(cin >> b){
		n = 0;
		fill(&dp[0][0], &dp[11][(1 << 12) - 1] + 1, (double)INF);
		getline(cin , s);
		istringstream in(s);
		while(in >> num) {
			r[n++] = num;
		}
		rep(i, n) dp[i][1 << i] = r[i] * 2;
		rep(i, 1 << n){
			rep(j, n){
				if(i & (1 << j)){
					rep(k, n){
						if(!(i & (1 << k))){
							dp[k][i | (1 << k)] = min(dp[k][i | (1 << k)],
								dp[j][i] + r[k] - r[j] + sqrt((r[k] + r[j]) * (r[k] + r[j]) - 
								(r[k] - r[j]) * (r[k] - r[j])));
						}
					}
				}
			}
		}
		double res = 1e10;
		rep(i, n) res = min(dp[i][(1 << n) - 1], res);
		//cout << n << " " << res  << endl;
		if(res < b + EPS) cout << "OK" << endl;
		else cout << "NA" << endl;
	}
	return 0;
}