ACM 猴子报数

#include "iostream"
#include "stdlib.h"
#include "search.h"
#include "algorithm"
#include "queue"

using namespace std;

int main()
{
int num, s, m;
while (1)
{
cin >> num >> s >> m;
if (num == 0 && s == 0 && m == 0)
break;

queue<int> qu;
for (int i = 0; i < num; i++)
{
qu.push(i + 1);
}

int i = 0, tmp;
while (i < s-1)
{
tmp = qu.front();
qu.pop();
qu.push(tmp);
i++;