//303595776
#define TASK "FLOWER"
#include <bits/stdc++.h>
#define int long long
#define ii pair<int, int>
#define fi first
#define se second
#define ENDL "\n"
using namespace std;

const int MAX = 55;
const int MOD = 1e9+7;

int n, m, k, f[MAX][MAX];

bool getBit(int x, int k){
    return 1 & (x >> (k-1));
}

int Pow(int x, int k){
    if (k==1) return x;
    long long tmp = Pow(x, k/2);
    tmp = (tmp*tmp)% MOD;
    if (k&1) tmp= (tmp*x)%MOD;
    return tmp;
}

signed main(int argc, char const *argv[])
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #ifndef ONLINE_JUDGE
        //freopen("input.txt","r",stdin);
        freopen(TASK".INP","r", stdin);
        freopen(TASK".OUT","w", stdout);
    #endif

    cin >> m >> n >> k;
    f[0][0] = 1;
    int MSK = 1 << 4;
    for(int i=1; i<=n; i++){
        for(int mask = 0; mask < MSK; mask++){
            f[i][mask] += f[i-1][mask]* __builtin_popcount(mask);
            f[i][mask]%= MOD;
            for(int j=1; j<=4; j++){
                if (!getBit(mask, j)){
                    f[i][mask|(1<<(j-1))] += f[i-1][mask];
                    f[i][mask|(1<<(j-1))]%= MOD;
                }
            }
        }
    }
    int res=0;
    for(int i=0; i<MSK; i++){
        if (__builtin_popcount(i)>=k){
            res+= f[n][i];
            res%= MOD;
        }
    }
    cout << Pow(res, m);
    return 0;
}