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

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