UVA 1394/POJ 3517 And Then There Was One

TMD,看了半天才看懂那个递推公式是怎么来的，就是个简单的递推题目

#include <stdio.h>
#include <stdlib.h>

int f(int n, int k){
	int value = 0;
	for(int i=2; i<=n; i++)
		value = (value+k) % i;
	return value;
}

void func(int n, int k, int m){
	int ans;

	ans = f(n, k);
	ans = (ans+1-(k-m)) % n;
	if(ans <=0){
		ans += n;
	}
	
	printf("%d\n", ans);
}

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

	//freopen("input.dat", "r", stdin);
	while(scanf("%d %d %d", &n, &k, &m) != EOF){
		if(!n && !k && !m)
			break;
		func(n, k, m);
	}
	return 0;
}