// Aizu 1335: Equal Sum Sets
// 2017.9.19 bal4u@uu

#include <stdio.h>
#include <string.h>

int dp[12][22][205];

int main()
{
	int n, k, s;
	int i, j, a, b, max;
	int ans;

	while (scanf("%d%d%d", &n, &k, &s) && n) {
		memset(dp, 0, sizeof(dp));
		for (i = 1; i <= n; i++) dp[1][i][i] = 1;
		for (max = n, j = 1; j < k; j++, max += n)
			for (i = 1; i <= n; i++) 
				for (a = 1; a <= max; a++)
					for (b = 1; b + i <= n; b++)
						dp[j+1][i+b][i+a+b] += dp[j][i][a];
		for (ans = 0, i = 1; i <= n; i++) ans += dp[k][i][s];
		printf("%d\n", ans);
	}
	return 0;
}