INF = 1e9

def width(r1, r2)
  r1 + r2 + Math::sqrt((r1 + r2) ** 2 - (r1 - r2).abs ** 2)
end

while list = gets
  box, *r = list.split.map(&:to_f)

  n = r.size
  all = (1 << n) - 1

  dp = Array.new(1 << n){Array.new(n, INF)}
  n.times do |i| dp[1 << i][i] = 2.0 * r[i] end
  (1 << n).times do |bit|
    n.times do |from|
      next if dp[bit][from] == INF
      n.times do |to|
        next if bit[to] == 1
        cost = dp[bit][from] - 2.0 * r[from] + width(r[from], r[to])
        next_bit = bit | (1 << to)
        dp[next_bit][to] = [dp[next_bit][to], cost].min
      end
    end
  end

  puts (dp[all].any?{|d| d <= box} ? "OK" : "NA")
end