#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

const int mod = 100000;

int main()
{
	while(true) {
	
		int n, m, s;
	
		scanf("%d%d%d", &n, &m, &s);
		
		if(n == 0 && m == 0 && s == 0)
			break;
	
		n = n * n;
		s -= (0 + (n - 1)) * n / 2;
		m = min(m, s);
	
		static int dp[3001][2001] = {0};
		
		memset(dp[0], 0, 3001 * 2001 * sizeof(int));
	
		for(int i = 1; i <= m; ++i)
			dp[i][i] = 1;
	
		for(int i = 1; i < n; ++i) {
		
			for(int x = 1; x <= m - i; ++x) {
	
				for(int sum = s; sum > x; --sum)
					dp[sum][x] = (dp[sum - 1][x - 1] + dp[sum - x][x]) % mod;

				for(int sum = x; sum > 0; --sum)
					dp[sum][x] = (dp[sum - 1][x - 1]) % mod;
			}	
		}
		
		int ans = 0;
		
		for(int i = 1; i <= m - (n - 1); ++i) {
			ans += dp[s][i];
			ans %= mod;
		}
		
		printf("%d\n", ans);
	}
	
	return 0;
}