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

#define int long long

const int maxn = 110;
const int mod = 1e9 + 7;
int jc[maxn],upm[maxn],ans;
int f[maxn][350][20];
int C[maxn][maxn];

int powe(int a, int b) {
    int base = 1;
    while(b) {
        if(b & 1) base = base * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return base;
}

int cc(int n, int m) {
    // return C[n][m];
    return jc[n] * powe(jc[m], mod - 2) % mod * powe(jc[n - m], mod - 2) % mod;
}

int c(int n, int m) {
    return C[n][m];
    // return jc[n] * powe(jc[m], mod - 2) % mod * powe(jc[n - m], mod - 2) % mod;
}

signed main() {
    // freopen("data.in", "r", stdin);
    int n, m, k;
    cin >> n >> m >> k;
    f[61][0][k]=1;
    jc[0]=1;
    for(int i=1;i<=20;i++) jc[i]=jc[i-1]*i%mod;
    for(int i=0;i<=k;i++)
    for(int j=0;j<=i;j++)
    C[i][j]=cc(i,j);
    
    for(int i=60;i>=0;i--)
    {
        int now=1ll<<i;
        int lk=(n&now)!=0;
        for(int j=0;j<=k*k/2;j++)
        for(int w=0;w<=k;w++)
        for(int a=0;a<=k-w;a++)
        {
            if(now&m)
            {
                for(int b=0;b<=w;b++)
                {
                    int nowj=j*2+lk-(k-a-b)*(a+b);
                    if(nowj<0) continue;
                    f[i][nowj][b]=(f[i][nowj][b]+f[i+1][j][w]*c(k-w,a)%mod*c(w,b))%mod;
                }
            }
            else
            {
                int nowj=j*2+lk-(k-a)*a;
                if(nowj<0) continue;
                f[i][nowj][w]=(f[i][nowj][w]+f[i+1][j][w]*c(k-w,a))%mod;
                // if(i==60)cout<<f[i][nowj][w]<<'\n';
            }
        }
    }
    for(int i=0;i<=k;i++) ans+=f[0][0][i];
    cout<<ans%mod<<'\n';
    return 0;
}