#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)

int dp[50][3001];
int n, m, s;
const int mod = 100000;

int main() {
	while (cin >> n >> m >> s, n || m || s) {
		n *= n;
		
		fill(dp[0], dp[n + 1], 0);
		
		dp[0][0] = 1;
		FOR(i, 1, m + 1) for (int j = n - 1; j >= 0; j--) REP(k, s + 1) {
			if (k + i > s) break;
			dp[j + 1][k + i] += dp[j][k];
			dp[j + 1][k + i] %= mod;
		}
		
		
		cout << dp[n][s] << endl;
	}
	return 0;
}