AOJ

1275.cpp

#include <bits/stdc++.h>
 
using namespace std;
 
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define mp make_pair
#define i_i pair<int, int>
#define vi vector<int>
#define vvi vector<vi >
#define vb vector<bool>
#define vvb vector<vb >
#define vp vector< i_i >
#define all(a) (a).begin(), (a).end()
#define Int(x) int x; scanf("%lld", &x);
 
//int dxy[5] = {0, 1, 0, -1, 0};
// assign
 
signed main()
{
    Int(n);
    Int(k);
    Int(m);
    while (n) {
        queue<int> q;
        For(i, m, n+1) {
            q.push(i);
        }
        Rep(i, m) {
            q.push(i);
        }
        q.pop();
        while (q.size() != 1) {
            Rep(i, k) {
                int tmp = q.front();
                q.pop();
                q.push(tmp);
            }
            q.pop();
        }
        cout << q.front() << endl;
        cin >> n >> k >> m;
    }
    return 0;
}