UVALive - 3882：And Then There Was One

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#define MAXN 10005
using namespace std;
int f[MAXN];
int n,m,k;
int main()
{
while(1){
scanf("%d%d%d",&n,&k,&m);
if(!n)break;
for(int i=2;i<=n;i++){
f[i]=(f[i-1]+k)%i;
}
printf("%d\n",((m-k+f
)%n+n)%n+1);
}
return 0;
}