#define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <iterator>

using namespace std;
typedef long long ll;
const int MODULO = 1000000007;
const int INF = 100000000; //1e8

typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef complex<double> Cd;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())

template<class T>
void splitstr(const string &s, vector<T> &out)
{
    istringstream in(s);
    out.clear();
    copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}

double C(vector<int> &a){
	double ret = a[0] + a[sz(a) - 1];
	FOR(i,sz(a)-1) ret += sqrt((double)a[i] * a[i+1]) * 2;
	return ret;
}

int main(){
	string s;
	while(getline(cin,s)){
		vector<int> a;
		splitstr(s,a);
		int n = a[0];
		a.erase(a.begin());
		sort(a.begin(),a.end());
		bool ok = false;
		do{
			if(C(a) <= n){
				ok = true;
				break;
			}
		}while(next_permutation(a.begin(),a.end()));

		cout << (ok ? "OK" : "NA") << endl;
	}
	return 0;
}