#include <bits/stdc++.h>
using namespace std;

const int mod = 1e5;

int main()
{
	ios::sync_with_stdio(false), cin.tie(0);
	int N, M, S;
	while (cin >> N >> M >> S, N | M | S) {
		N *= N;
		vector<vector<int>> dp(S + 1, vector<int>(N + 1));
		dp[0][0] = 1;
		for (int i = 1; i <= M; i++) {
			for (int j = S; j >= i; j--) {
				for (int k = N; k > 0; k--) {
					(dp[j][k] += dp[j - i][k - 1]) %= mod;
				}
			}
		}
		printf("%d\n", dp[S][N]);
	}
	return 0;
}

