#include <iostream>

#include <cstdio>

#include <cstring>

#include <queue>

#include <cmath>

#include <vector>

#include <algorithm>

using namespace std;

#define lowbit(x) (x&(-x))

#define max(x,y) (x>y?x:y)

#define min(x,y) (x<y?x:y)

#define mem(a) (memset(a,0,sizeof(a)))

typedef long long ll;

int main()

{

  int N,k,m;

  while(cin>>N>>k>>m && (N && k && m)){

    int ans=;

    for(int i=;i<=N-;i++){

      ans=(ans+k)%i;

    }

    cout<<((ans+m)%N+)<<endl;

  }

    return ;

}

#include<iostream>

#include<queue>

using namespace std;

int main()

{

  int N,k;

  while(cin>>N>>k){

    int ans=;

    for(int i=;i<=N;i++){

      ans=(ans+k)%i;

    }

    cout<<ans+<<endl;

  }

  return ;

}