import std.algorithm;
import core.stdc.stdio;
import std.stdio;

void main(){
	while(1){
		int n,m,s;
		scanf("%d%d%d",&n,&m,&s);
		if(n==0&&m==0&&s==0)
			break;
		int[] now = new int[(n*n+1)*(s+1)];
		int[] next = new int[(n*n+1)*(s+1)];
		now[0] = 1;
		for(int i=1;i<=m;i++){
			next[] = 0;
			for(int j=0;j<=n*n;j++){
				for(int k=0;k<=s;k++){
					if(k+i<=s && j < n*n){
						next[(j+1)*(s+1)+k+i] = (next[(j+1)*(s+1)+k+i]+now[j*(s+1)+k])%100000;
					}
					next[j*(s+1)+k] = (next[j*(s+1)+k]+now[j*(s+1)+k])%100000;
				}
			}
			swap(now,next);
		}
		printf("%d\n",now[(n*n)*(s+1)+s]);
	}
}