编辑代码

function queue(n, m)
    if m > n
    then
        m = m % n
    end

    i = 1
    _list = {}
    while i <= n
    do
        _list[i] = i
        i = i + 1
    end


    result = {}

    while #_list > 3
    do
        table.insert(result, _list[m])
        table.remove(_list, m)

        j = 1

        while j < m
        do
            table.insert(_list, _list[1])
            table.remove(_list, 1)
            j = j + 1
        end

    end

    table.insert(result, _list[3])
    table.insert(result, _list[1])
    table.insert(result, _list[2])

    value = ""
    for i, j in pairs(result)
    do
        value = value.. " " .. tostring(j)
    end
    return value



end



value = queue(n, m)
print(value)