#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int*)a, (int*)(a + LENGTHOF(a)), b)
#define SQ(x) ((x)*(x))
#define Mod(x, mod) (((x)+(mod)%(mod))
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define INF 1 << 30
#define EPS 1e-10
#define MOD 100000

typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;

int dp[2][64][4096];
int N, M, S;

int main(){
  while(cin >> N >> M >> S){;
    if(!N && !M && !S) break;
    memset(dp, 0, sizeof(dp));
    int res = 0;
    int cur, tar;
    dp[0][0][0]=1;
    REP(i, 1, M+1){
      cur = (i+1)%2;
      tar = (cur+1)%2;
      memset(dp[tar], 0, sizeof(dp[tar]));
      rep(j,SQ(N)){
	rep(k, S){
	  if(k+i <= S) dp[tar][j+1][k+i] = (dp[tar][j+1][k+i] + dp[cur][j][k])%MOD;
	  dp[tar][j][k] = (dp[tar][j][k] + dp[cur][j][k])%MOD;
	}
      }
      /*      rep(i, SQ(N)+1){
	rep(j, S+1) cout << dp[tar][i][j] << " ";
	cout << endl;
	}cout<<endl;*/
      res = (res+dp[tar][SQ(N)][S])%MOD;
    }
    //    int res = 0;
    
    //    REP(i,1, M+1) res = (res+dp[tar][i][S])%MOD;
    //    cout << res << endl;
    cout << res << endl;
  }
  return 0;
}