local bls, brs = bit.lshift, bit.rshift
local mfl, mce = math.floor, math.ceil
local mmi, mma = math.min, math.max

local limit = io.read("*n")
local n = io.read("*n")
local cost = {}
for i = 1, n do
  cost[i] = io.read("*n")
end

local function bdp_prepare()
  local tot = 1
  local alltask = {}
  local stagetask = {}
  for i = 1, n do
    tot = tot * 2
    stagetask[i] = {}
  end
  for i = 1, tot - 1 do
    alltask[i] = 150000
  end
  for i = 1, tot - 1 do
    local ti = i
    local cnt = 0
    for j = 1, n do
      if ti % 2 == 1 then
        cnt = cnt + 1
        ti = ti - 1
      end
      ti = ti / 2
    end
    table.insert(stagetask[cnt], i)
  end
  -- set first state
  local tmp = 1
  for i = 1, n do
    alltask[tmp] = cost[i]
    tmp = tmp * 2
  end
  return tot, alltask, stagetask
end

local function bdp_doall(alltask, stagetask)
  for stage = 1, n - 1 do
    local stlen = #stagetask[stage]
    for i_stagetask = 1, stlen do
      local used = stagetask[stage][i_stagetask]
      local mul = 1
      local tmp = used
      for j = 1, n do
        if tmp % 2 == 0 then
          local nxt = alltask[used] + cost[j]
          if mce(nxt / limit) ~= mce(alltask[used] / limit) then
            nxt = limit * mce(alltask[used] / limit) + cost[j]
          end
          alltask[used + mul] = mmi(alltask[used + mul], nxt)
        else
          tmp = tmp - 1
        end
        tmp = tmp / 2
        mul = mul * 2
      end
    end
  end
end

local function bdp_getresult(tot, alltask)
  return alltask[tot - 1]
end

local tot, alltask, stagetask = bdp_prepare()
bdp_doall(alltask, stagetask)
local ret = bdp_getresult(tot, alltask)
print(mce(ret / limit))