#include <iostream>

using namespace std;

int Josephus(int n, int k, int s)
{
  long long x = k * s;
  while (x > n) { x = ((x-n)*k-1) / (k-1); }
  return (int)x;
}

int main()
{
  int n, k, m;

  while (cin >> n >> k >> m) {
    if (n == 0 && k == 0 && m == 0) { break; }
    int j = Josephus(n, k, n) - k + 1 + m - 1;
    while (j <= 0) { j += n; }
    while (j > n) { j -= n; }
    cout << j << endl;
  }
  return 0;
}