#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
using mint = atcoder::modint1000000007;

template <class T, size_t N> struct Matrix {
    std::array<std::array<T, N>, N> A{};
    Matrix() {}
    Matrix(const std::array<std::array<T, N>, N> &M) : A(M){}
    Matrix(const std::vector<std::vector<T>> &M)  {
        for(size_t i = 0; i < N; i++){
            for(size_t j = 0; j < N; j++){
                A[i][j] = M[i][j];
            }
        }
    }
    const std::array<T, N>& operator[](int i) const { return A[i]; }
    std::array<T, N>& operator[](int i) { return A[i]; }

    Matrix& operator+=(const Matrix& rhs) {
        for(size_t i = 0; i < N; i++){
            for(size_t j = 0; j < N; j++){
                A[i][j] += rhs[i][j];
            }
        }
        return *this;
    }
    Matrix& operator-=(const Matrix& rhs) {
        for(size_t i = 0; i < N; i++){
            for(size_t j = 0; j < N; j++){
                A[i][j] -= rhs[i][j];
            }
        }
        return *this;
    }
    Matrix& operator*=(const Matrix& rhs) {
        std::array<std::array<T, N>, N> res{};
        for(size_t i = 0; i < N; i++){
            for(size_t j = 0; j < N; j++){
                for(size_t k = 0; k < N; k++){
                    res[i][j] += A[i][k] * rhs[k][j];
                }
            }
        }
        swap(A, res);
        return *this;
    }
    Matrix& operator+() const { return *this; }
    Matrix& operator-() const { return Matrix() - *this; }
    friend Matrix operator+(const Matrix& lhs, const Matrix& rhs) {
        return Matrix(lhs) += rhs;
    }
    friend Matrix operator-(const Matrix& lhs, const Matrix& rhs) {
        return Matrix(lhs) -= rhs;
    }
    friend Matrix operator*(const Matrix& lhs, const Matrix& rhs) {
        return Matrix(lhs) *= rhs;
    }
    friend bool operator==(const Matrix& lhs, const Matrix& rhs) {
        return (lhs.A == rhs.A);
    }
    friend bool operator!=(const Matrix& lhs, const Matrix& rhs) {
        return (lhs.A != rhs.A);
    }
    Matrix pow(long long v){
        Matrix res, temp = A;
        for(size_t i = 0; i < N; i++)res[i][i] = 1;
        while(v){
            if(v & 1)res *= temp;
            temp *= temp;
            v >>= 1;
        }
        return res;
    }
    friend std::ostream& operator << (std::ostream &os, const Matrix& rhs) noexcept {
        for(size_t i = 0; i < N; i++){
            if(i) os << '\n';
            for(size_t j = 0; j < N; j++){
                os << (j ? " " : "") << rhs[i][j];
            }
        }
        return os;
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll N, P, C;
    cin >> N >> P >> C;
    vector<int> D1 = {2, 3, 5, 7, 11, 13}, D2 = {4, 6, 8, 9, 10, 12};
    vector<mint> dp1(66), dp2(61), dp(131);
    function<void(int,int,int)> dfs1 = [&](int i, int s, int v){
        if(i == P){dp1[v]++; return; }
        for(int j = s; j < 6; j++)dfs1(i + 1, j, v + D1[j]);
    };
    function<void(int,int,int)> dfs2 = [&](int i, int s, int v){
        if(i == C){dp2[v]++; return; }
        for(int j = s; j < 6; j++)dfs2(i + 1, j, v + D2[j]);
    };
    dfs1(0, 0, 0), dfs2(0, 0, 0);
    for(int i = 0; i < 66; i++){
        for(int j = 0; j < 61; j++){
            dp[i + j] += dp1[i] * dp2[j];
        }
    }
    Matrix<mint, 131> Mt;
    for(int i = 1; i <= 130; i++){
        Mt[i - 1][0] = dp[i];
        Mt[i - 1][i] = 1;
    }
    auto A = Mt.pow(N);
    int r = min(N, 130ll);
    vector<mint> dp3(r + 1);
    for(int i = 0; i <= r; i++){
        dp3.rbegin()[i] = A[0][i];
    }
    mint ans = dp3.back();
    for(int i = r - 1; i >= 0; i--){
        for(int j = r + 1 - i; j < dp.size(); j++){
            ans += dp3[i] * dp[j];
        }
    }
    cout << ans.val() << '\n';
}