#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

int main ()
{
    int n, m, s, dp[50][3001];
    while (1)
    {
        cin>>n>>m>>s;
        if (!n) break;
        n*=n;
        m=min(m, s);
        memset(dp, 0, sizeof(dp));
        dp[0][0]=1;
        for (int i=1; i<=n; i++)
        {
            for (int j=1; j<=s; j++)
            {
                if (j>=i) dp[i][j]=dp[i-1][j-i]+dp[i][j-i];
                if (j>m) dp[i][j]-=dp[i-1][j-m-1];
                dp[i][j]%=100000;
                if (dp[i][j]<0) dp[i][j]+=100000;
            }
        }
        cout<<dp[n][s]<<'\n';
    }
    return 0;
}

