#include <stdio.h>
#include <algorithm>

using namespace std;

int _now[50*3001];
int _next[50*3001];

int main(){
	while(1){
		int n,m,s;
		scanf("%d%d%d",&n,&m,&s);
		if(n==0&&m==0&&s==0)
			break;
		int* now = _now;
		fill(now,now+(n*n+1)*(s+1),0);
		int* next = _next;
		fill(next,next+(n*n+1)*(s+1),0);
		now[0] = 1;
		for(int i=1;i<=m;i++){
			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] += now[j*(s+1)+k];
						if(next[(j+1)*(s+1)+k+i] >= 100000)
							next[(j+1)*(s+1)+k+i] -= 100000;
					}
					next[j*(s+1)+k] += now[j*(s+1)+k];
					if(next[j*(s+1)+k] >= 100000)
						next[j*(s+1)+k] -= 100000;
					now[j*(s+1)+k] = 0;
				}
			}
			swap(now,next);
		}
		printf("%d\n",now[(n*n)*(s+1)+s]);
	}
}