#pragma GCC optimize ("O3")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

#define _rep(_1, _2, _3, name, ...) name
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _rep(__VA_ARGS__, rep3, rep2, _)(__VA_ARGS__)

using namespace std;

using ll = long long;

const int MOD = 1e9 + 7;
const ll LMOD = ll(MOD) << 32;

int add_mod(int a, int b) { return (a += b) >= MOD ? a - MOD : a; }
ll add_mod64(ll a, ll b) { return (a += b) >= LMOD ? a - LMOD : a; }
ll sub_mod64(ll a, ll b) { return (a -= b) < 0 ? a + LMOD : a; }

using poly = vector<int>;
vector<ll> buff;

poly poly_mul(const poly& f, const poly& g) {
  int s1 = f.size(), s2 = g.size(), s = s1 + s2 - 1;
  buff.assign(s, 0);
  rep(i, s1) if (f[i]) rep(j, s2) buff[i + j] = add_mod64(buff[i + j], ll(f[i]) * g[j]);
  poly ret(s);
  rep(i, s) ret[i] = buff[i] % MOD;
  return ret;
}

poly poly_rem(const poly& f, const poly& g) {
  int s1 = f.size(), s2 = g.size();
  if (s1 < s2) return f;
  assert(g[0] == 1);
  buff.resize(s1);
  copy(f.begin(), f.end(), buff.begin());
  rep(i, s1 - s2 + 1) {
    int c = buff[i] % MOD;
    if (c) rep(j, 1, s2) buff[i + j] = sub_mod64(buff[i + j], ll(c) * g[j]);
    buff[i] = c;
  }
  poly ret(s2 - 1);
  rep(i, s2 - 1) ret[i] = buff[s1 - s2 + 1 + i] % MOD;
  return ret;
}

poly poly_x_pow_mod(ll e, const poly& f) {
  if (e == 0) return poly(1, 1);
  poly ret = poly({1, 0});
  ll mask = (ll(1) << (63 - __builtin_clzll(e))) >> 1;
  while (mask) {
    ret = poly_mul(ret, ret);
    if (e & mask) ret.push_back(0);
    ret = poly_rem(ret, f);
    mask >>= 1;
  }
  return ret;
}

poly init_poly(const int* dice, int T) {
  static int dp[301][3901];
  rep(i, T + 1) fill(dp[i], dp[i] + dice[5] * i + 1, 0);
  dp[0][0] = 1;
  rep(di, 6) rep(t, T) rep(i, t * dice[0], t * dice[di] + 1) {
    int& c = dp[t + 1][i + dice[di]];
    c = add_mod(c, dp[t][i]);
  }
  poly ret(dice[5] * T + 1);
  rep(i, dice[5] * T + 1) ret[i] = dp[T][i];
  return ret;
}

int main() {
  const int Ps[] = {2, 3, 5, 7, 11, 13};
  const int Cs[] = {4, 6, 8, 9, 10, 12};

  ll N; int P, C;
  while (~scanf("%lld %d %d", &N, &P, &C)) {
    auto p1 = init_poly(Ps, P);
    auto p2 = init_poly(Cs, C);
    auto f = poly_mul(p1, p2);
    rep(i, 1, f.size()) f[i] = f[i] ? MOD - f[i] : 0;
    f[0] = 1;
    auto r = poly_x_pow_mod(N + f.size() - 2, f);
    ll ans = 0;
    rep(i, r.size()) ans += r[i];
    printf("%llu\n", ans % MOD);
  }
  return 0;
}