#include "bits/stdc++.h"

using namespace std;
using ll = long long;
using ull = unsigned long long;

typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
typedef pair<P, P> PPP;

const ll MOD = 1e9 + 7;
const ll INF = 9e18;
const double DINF = 5e14;
const double eps = 1e-10;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };

#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
#define pb push_back
#define eb emplace_back
#define fr first
#define sc second


int n, m, s, mod = 100000;

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