#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

vint x,k;
double n;
int m;
string str;

void input(){
	int c;
	x.clear();
	bool first=true;
	int num=0;
	int i;
	for(i=0;i<str.size();i++){
		c=str[i];
		if(c==' '){
			if(first){
				n=num;
				num=0;
				first=false;
			}else{
				x.push_back(num);
				m++;
				num=0;
			}
		}else{
			num=num*10+c-'0';
		}
	}
	if(num!=0){x.push_back(num);m++;}
	return;
}

double hoge(){
	double res=x[k[0]]+x[k[m-1]];
	int i;
	for(i=0;i<m-1;i++){
		res+=sqrt((x[k[i]]+x[k[i+1]])*(x[k[i]]+x[k[i+1]])-(x[k[i]]-x[k[i+1]])*(x[k[i]]-x[k[i+1]]));
	}
	return res;
}

int main() {
	while(getline(cin,str)){
		x.clear();k.clear();m=0;
		input();
		int i;
//cout<<n<<endl;
//for(i=0;i<m;i++)cout<<x[i]<<endl;
		for(i=0;i<m;i++)k.push_back(i);
		double res=10000;
		do{
			chmin(res,hoge());
//int j;
//for(j=0;j<m;j++)cout<<k[j]<<" ";
//cout<<hoge()<<endl;
		}while(next_permutation(k.begin(),k.end()));
//cout<<res<<" "<<n<<endl;
		cout<<(res<=n?"OK":"NO")<<endl;
	}
	return 0;
}