#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }


const int MOD = 100000;
int N, M, S;

void add(int &a, int b) { a += b; if (a >= MOD) a -= MOD; }

int pre[9][9][9][9][9][9][9];
int dp[3][55][3100];

int main() {
//    memset(pre, 0, sizeof(pre));
//    pre[0][0][0][0][0][0][0] = 1;
//    for (int a = 0; a <= 7; ++a)
//        for (int b = 0; b <= a; ++b)
//            for (int c = 0; c <= b; ++c)
//                for (int d = 0; d <= c; ++d)
//                    for (int e = 0; e <= d; ++e)
//                        for (int f = 0; f <= e; ++f)
//                            for (int g = 0; g <= f; ++g) {
//                                //cout << a <<","<<b<<","<<c<<","<<d<<","<<e<<","<<f<<","<<g<<": "<<pre[a][b][c][d][e][f][g]<<endl;
//                                add(pre[a+1][b][c][d][e][f][g], pre[a][b][c][d][e][f][g]);
//                                if (a >= b+1) add(pre[a][b+1][c][d][e][f][g], pre[a][b][c][d][e][f][g]);
//                                if (b >= c+1) add(pre[a][b][c+1][d][e][f][g], pre[a][b][c][d][e][f][g]);
//                                if (c >= d+1) add(pre[a][b][c][d+1][e][f][g], pre[a][b][c][d][e][f][g]);
//                                if (d >= e+1) add(pre[a][b][c][d][e+1][f][g], pre[a][b][c][d][e][f][g]);
//                                if (e >= f+1) add(pre[a][b][c][d][e][f+1][g], pre[a][b][c][d][e][f][g]);
//                                if (f >= g+1) add(pre[a][b][c][d][e][f][g+1], pre[a][b][c][d][e][f][g]);
//                            }

    
    while (cin >> N >> M >> S) {
        if (N == 0) break;
        
        memset(dp, 0, sizeof(dp));
        dp[0][0][0] = 1;
        for (int i = 0; i < M; ++i) {
            for (int j = 0; j <= N*N; ++j) 
                for (int k = 0; k <= S; ++k) 
                    dp[(i+1)%2][j][k] = 0;
            
            for (int j = 0; j <= N*N; ++j) 
                for (int k = 0; k <= S; ++k) {
                    add(dp[(i+1)%2][j][k], dp[i%2][j][k]);
                    if (k+i+1 <= S) add(dp[(i+1)%2][j+1][k+i+1], dp[i%2][j][k]);
                }
        }
        
        long long res1 = dp[M%2][N*N][S];
        long long res2 = 1;
//        if (N == 1) res2 = pre[1][0][0][0][0][0][0];
//        if (N == 2) res2 = pre[2][2][0][0][0][0][0];
//        if (N == 3) res2 = pre[3][3][3][0][0][0][0];
//        if (N == 4) res2 = pre[4][4][4][4][0][0][0];
//        if (N == 5) res2 = pre[5][5][5][5][5][0][0];
//        if (N == 6) res2 = pre[6][6][6][6][6][6][0];
//        if (N == 7) res2 = pre[7][7][7][7][7][7][7];
        
        //COUT(res1); COUT(res2);
        
        long long res = (res1 * res2) % MOD;
        cout << res << endl;
    }
    return 0;
}


Measured memory_bytes: 3164