#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

const int MOD = 1000000007;

// 行列の積
template <class T>
vector<vector<T> > matrixProduct(const vector<vector<T> >& x, const vector<vector<T> >& y)
{
    int a = x.size();
    int b = x[0].size();
    int c = y[0].size();
    vector<vector<T> > z(a, vector<T>(c, 0));
    for(int i=0; i<a; ++i){
        for(int j=0; j<c; ++j){
            for(int k=0; k<b; ++k){
                z[i][j] += x[i][k] * y[k][j];
                z[i][j] %= MOD;
            }
        }
    }
    return z;
}

// 行列の累乗
template <class T>
vector<vector<T> > matrixPower(const vector<vector<T> >& x, long long k)
{
    int n = x.size();
    vector<vector<T> > y(n, vector<T>(n, 0));
    for(int i=0; i<n; ++i)
        y[i][i] = 1; // 積の単位元

    vector<vector<T> > z = x;
    while(k > 0){
        if(k & 1)
            y = matrixProduct(y, z);
        z = matrixProduct(z, z);
        k >>= 1;
    }
    return y;
}

void solve(const vector<int>& dice, int n, vector<int>& ans)
{
    int m = *max_element(dice.begin(), dice.end()) * n;
    
    vector<vector<int> > dp(n+1, vector<int>(m+1, 0));
    dp[0][0] = 1;
    for(int a : dice){
        for(int i=0; i<n; ++i){
            for(int j=0; j<=m-a; ++j){
                dp[i+1][j+a] += dp[i][j];
                dp[i+1][j+a] %= MOD;
            }
        }
    }
    ans = dp[n];
}

int main()
{
    const vector<int> dice1 = {2, 3, 5, 7, 11, 13};
    const vector<int> dice2 = {4, 6, 8, 9, 10, 12};

    long long n;
    int p, c;
    cin >> n >> p >> c;
    vector<int> a, b;
    solve(dice1, p, a);
    solve(dice2, c, b);

    int m = a.size() + b.size() - 1;
    vector<int> x(m, 0);
    for(unsigned i=0; i<a.size(); ++i){
        for(unsigned j=0; j<b.size(); ++j){
            x[i+j] += a[i] * b[j];
        }
    }

    vector<vector<long long> > mat(m, vector<long long>(m, 0));
    for(int i=0; i<m-1; ++i){
        mat[0][i] = x[i+1];
        mat[i+1][i] = 1;
    }
    mat = matrixPower(mat, n);

    long long ans = 0;
    for(int i=1; i<m; ++i){
        for(int j=i; j<m; ++j){
            ans += mat[i][0] * x[j];
            ans %= MOD;
        }
    }
    cout << ans << endl;

    return 0;
}