#include <iostream>
#include <list>
using namespace std;

int lastremaining(unsigned int n,unsigned int m)
{
    if(n<1||m<1)
        return -1;
    unsigned int i=0;
    list<int> numbers;
    for(i=0;i<n;i++)
        numbers.push_back(i);
    list<int>::iterator cur=numbers.begin();
    while(numbers.size()>1)
    {
        for(i=1;i<m;i++)
        {
            cur++;
            if(cur==numbers.end())
                cur=numbers.begin();
        }
        list<int>::iterator next=++cur;
        if(next==numbers.end())
            next=numbers.begin();
        --cur;
        numbers.erase(cur);
        cur=next;
    }

    return *cur;
}
int main()
{
    cout<<lastremaining(5,3);
}