[Snippet] Permutations

function unpack (t, i)
  i = i or 1
  if t[i] ~= nil then
    return t[i], unpack(t, i + 1)
  end
end
function map(f, a, ...) if a then return f(a), map(f, ...) end end
function incr(k) return function(a) return k > a and a or a+1 end end
function combs(m, n)
  if m * n == 0 then return {{}} end
  local ret, old = {}, combs(m-1, n-1)
  for i = 1, n do
    for k, v in pairs(old) do ret[#ret+1] = {i, map(incr(i), unpack(v))} end
  end
  return ret
end

list = {}
for k, v in pairs(combs(4, 10)) do list = ArrayAdd(list, {unpack(v)}) end

list = ArrayDistinct(list)
for k,v in pairs(list) do 
    Log(v)
end