#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	while(true){
		int n,m,s;
		cin >> n >> m >> s;
		if(n == 0) break;
		int ans = 0;
		int dp[2][50][3005];
		memset(dp,0,sizeof(dp));
		dp[0][0][0] = 1;
		for (int i = 1;i <= m ;i++){
			for (int j = 0;j <= n*n;j++){
				for (int k = 0;k <= s;k++){
					if(k-i>= 0) dp[i%2][j][k] = dp[(i-1)%2][j][k] + dp[(i-1)%2][j-1][k-i];
					else dp[i%2][j][k] = dp[(i-1)%2][j][k];
					dp[i%2][j][k] %= 100000;
				}
			}
		}
		cout << dp[m%2][n*n][s] << endl;
	}

	return 0;

}
