#include<bits/stdc++.h>
#define LL long long
#define rep(i,n) for(int i=0;i<n;++i)
#define per(i,n) for(int i=n;i>0;i--)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define ROF(i,a,b) for(int i=a;i>=b;i--);
#define push_back PB;
#define pop_back PPB;
using namespace std;
static const LL INF = 1LL<<61LL;
static const double EPS = 1e-8;
static const int mod = 100000;
typedef pair<int,int> PII;

LL dp[51][3001];

int main(){
    while(1){
        LL N,M,S;
        cin>>N>>M>>S;
        if(N==0&&M==0&&S==0)break;
        N*=N;
        memset(dp,0,sizeof(dp));
        dp[0][0]=1;
        FOR(i,1,M){
            per(j,N){
                FOR(k,i,S){
                    dp[j][k]+=dp[j-1][k-i]%mod;
                }
            }
        }
        cout<<dp[N][S]%mod<<endl;
    }
    return 0;
}