#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

const ULL M = 1000000007;

int dice1[6] = { 2,3,5,7,11,13 };
int dice2[6] = { 4,6,8,9,10,12 };

int P, C;
ULL N;

const int maxPC = 5;
const int Z = 25 * maxPC;
ULL X[Z] = {};
ULL D[Z] = {};

void initD() {
    int dp[Z + 25][6] = {};
    dp[0][0] = 1;
    rep(i, P) {
        for (int j = Z; j >= 0; j--) rep(p, 6) {
            if (p != 5) dp[j][p + 1] = (dp[j][p + 1] + dp[j][p]) % M;
            dp[j + dice1[p]][p] = (dp[j + dice1[p]][p] + dp[j][p]) % M;
            dp[j][p] = 0;
        }
    }
    rep(i, Z + 1) {
        rep(j, 5) dp[i][0] += dp[i][j + 1];
        rep(j, 5) dp[i][j + 1] = 0;
    }
    rep(i, C) {
        for (int j = Z; j >= 0; j--) rep(p, 6) {
            if (p != 5) dp[j][p + 1] = (dp[j][p + 1] + dp[j][p]) % M;
            dp[j + dice2[p]][p] = (dp[j + dice2[p]][p] + dp[j][p]) % M;
            dp[j][p] = 0;
        }
    }
    rep(i, Z + 1) {
        rep(j, 5) dp[i][0] += dp[i][j + 1];
        rep(j, 5) dp[i][j + 1] = 0;
    }
    rep(i, Z) D[i] = dp[i + 1][0];
    rep(i, Z) X[i] = dp[i + 1][0];
    for (int i = Z - 1; i >= 1; i--) X[i - 1] += X[i];
}

int main() {
    cin >> N >> P >> C; N--;
    initD();

    ULL G[Z][Z] = {};
    rep(i, Z - 1) G[i][i + 1] = 1;
    rep(i, Z) G[i][0] = D[i];

    ULL tmp[Z][Z] = {};
    ULL buf[Z][Z] = {}; rep(i, Z) buf[i][i] = 1;
    for (ULL d = 1ull << 60; d != 0; d >>= 1) {
        rep(i, Z) rep(j, Z) tmp[i][j] = 0;
        rep(i, Z) rep(j, Z) rep(k, Z) tmp[i][k] = (tmp[i][k] + buf[i][j] * buf[j][k]) % M;
        rep(i, Z) rep(j, Z) buf[i][j] = tmp[i][j];
        if (N & d) {
            rep(i, Z) rep(j, Z) tmp[i][j] = 0;
            rep(i, Z) rep(j, Z) rep(k, Z) tmp[i][k] = (tmp[i][k] + buf[i][j] * G[j][k]) % M;
            rep(i, Z) rep(j, Z) buf[i][j] = tmp[i][j];
        }
    }

    ULL ans = 0;
    rep(i, Z) ans = (ans + buf[0][i] * X[i]) % M;
    cout << ans << endl;

    return 0;
}