#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <functional>
#include <map>
#include <set>
#include <cmath>
#include <string>
#define SIZE 200005
#define INF 1000000005LL
#define MOD 100000

using namespace std;
typedef long long int ll;
typedef pair <int,int> P;

int dp[3005][50];

int main()
{
	int N,M,S;
	while(1){
		scanf("%d%d%d",&N,&M,&S);
		if(N==0 && M == 0)break;
		N = N*N;
		S -= N*(N+1)/2;
		M -= N;
		if(S < 0 || M < 0){
			puts("0");
			continue;
		}
		for(int i=0;i<=S;i++){
			for(int j=0;j<=N;j++){
				dp[i][j]=0;
			}
		}
		dp[0][0]=1;
		for(int i=0;i<=S;i++){
			for(int j=1;j<=N;j++){
				dp[i][j] = dp[i][j-1];
				if(i-j>=0)(dp[i][j] += dp[i-j][j])%=MOD;
				if(i-j-M >= 0)(dp[i][j] += MOD-dp[i-j-M][j-1])%=MOD;
			}
		}
		printf("%d\n",dp[S][N]);
	}

	return 0;
}

