#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <climits>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ALL(A)		(A).begin(),(A).end()
#define DUMP(A)    cout<<#A<<"="<<(A)<< endl
#define SIZE(A)    (int)((A).size())
#define SQ(A)   ((A)*(A))
using namespace std;
typedef long long ll;

int main(){
    int role[12];
    char *li;
    string str;
    while(getline(cin,str)){
        li=(char *)str.c_str();
        int len;
        char sp[]=" ";
        char *res=NULL;
        sscanf(strtok(li,sp),"%d",&len);
        int n=0;
        for(;;){
            res=strtok(NULL,sp);
            if(res==NULL) break;
            sscanf(res,"%d",&role[n]);
            n++;
        }
        double path[13][13];
        for(int i=0;i<n;i++){
            path[0][i]=path[i][0]=role[i];
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                path[i][j]=sqrt(SQ(role[i]+role[j])-SQ(role[i]-role[j]));
            }
        }
        double dp[1<<n][n];
        for(int i=0;i<(1<<n);i++){
            for(int j=0;j<n;j++){
                dp[i][j]=10000;
            }
        }
        for(int i=0;i<n;i++){
            dp[1<<i][i]=role[i];
        }
        for(int i=1;i<(1<<n);i++){
            for(int j=0;j<n;j++){
                if(i&(1<<j)){
                    int bef=i-(i&(1<<j));
                    for(int k=0;k<n;k++){
                        if(bef&(1<<k)){
                            dp[i][j]=min(dp[i][j],dp[bef][k]+path[k][j]);
                        }
                    }
                }
            }
        }
        double ret=10000;
        for(int i=0;i<n;i++){
            ret=min(ret,dp[(1<<n)-1][i]+role[i]);
        }
        if(ret<=len) printf("OK\n");
        else printf("NA\n");
    }
}