#include <bits/stdc++.h>
using namespace std;

ifstream fin("arbori.in");
ofstream fout("arbori.out");

long long dp[91][11][91];

int main()
{
    long long n, m, k;
    fin>>n>>m>>k;
    for(long long i=1;i<=n;++i) dp[1][0][i]=1;
    for(long long i=2;i<=n;++i){
      dp[i][(i-1)%m][1]=1;
      for(long long j=0;j<=m;++j){
        for(long long l=2;l<=n;++l){
          long long x=1;
          for(long long cnt=0;cnt*l<i;++cnt){
            dp[i][j][l]+=dp[i-cnt*l][(j-cnt+10*m)%m][l-1]*x;
            x=x*(dp[l][(k+m-1)%m][n]+cnt)/(cnt+1);
          }
        }
      }
    }
    fout<<dp[n][k][n]<<"\n";
    return 0;
}