#include<cstdio>
#include<algorithm>

using namespace std;

#define rep(i,n) for(i=0;i<n;i++)
#define reps(i,n) for(i=1;i<=n;i++)

int dp[50][2][3001];

int main(){
	
	int n,m,s,nn,st,i,j,k;
	int t1=0,t2=1;
	while(1){
		scanf("%d%d%d",&n,&m,&s);
		if(n==0)break;
		
		t1=0;
		t2=1;
		n*=n;
		rep(i,50)rep(j,2)rep(k,s+1)dp[i][j][k]=0;
		dp[0][0][0]=1;
		reps(j,m){
			
			dp[0][t2][0]=1;
			
			reps(i,n){
				nn=i;
				st=(nn*(nn+1))/2;
				int mm,pp,end;
				mm=(j-1)/2;
				if(j%2==0)pp=j/2;
				else pp=0;
				
				end= min(mm*(mm+1) + pp + st,s+1);
				
				for(k=st-1;k<=end;k++){
					dp[i][t2][k]=0;
					if(k-j>=0){
						dp[i][t2][k]+=dp[i-1][t1][k-j];
					}
					dp[i][t2][k]+=dp[i][t1][k];
					if(dp[i][t2][k]<0)puts("AAAAAAA");
					dp[i][t2][k]%=100000;
				}
				/*
				if(i<9&&j<12){
					printf("%d %d\n",i,j);
					for(int k=0;k<50;k++){
						printf("%d ",dp[i][t2][k]);
					}puts("");
				}*/
			}
			swap(t1,t2);
		}
		
		printf("%d\n",dp[n][t1][s]);
	}
}