规律：f(i)=(f(i-1)+m)%i

百度链接：https://baike.baidu.com/item/%E7%BA%A6%E7%91%9F%E5%A4%AB%E9%97%AE%E9%A2%98/3857719?fromtitle=%E7%BA%A6%E7%91%9F%E5%A4%AB%E7%8E%AF&fromid=348830&fr=aladdin

include

using namespace std;
int main(){
int n,k,m;
scanf("%d %d %d",&n,&k,&m);
int re=0;
for(int i=2;i<=n;++i){
re=(re+m)%i;//f(i)=(f(i-1)+m)%i
}
printf("%d\n",(re+k)%n);//re+k可能大于n
return 0;
}