#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,b,n) for(int i=b;i<n;i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int N,M,S;
const int MOD =100000;
ll dp[3010][51];
int main(){
	while(cin>>N>>M>>S,N||M||S){
		memset(dp,0,sizeof(dp));
		dp[0][0] = 1;
		for(int i =1;i <=M;i++){
			for(int j =N*N;j >=1;j--){
				for(int k = 1;k <=S;k++){
					if(k-i>=0){
						dp[k][j]=(dp[k][j]+dp[k-i][j-1])%MOD;
					}
				}
			}
		}
		cout <<dp[S][N*N]<<endl;
	}
	return 0;
}