#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

#define MOD 1000000007

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

template<class T>
class kitamasa{
public:
	int max_n;
	vector<T> A;
	vector<T> X;

	kitamasa(vector<T>& a, vector<T>& x){
		for(int i=0; i<a.size(); i++){ A.push_back(a[i]); }
		//X.push_back(0);
		for(int i=0; i<x.size(); i++){ X.push_back(x[i]); }
	}

	//ΣΣ Pi Qj X(i+j) -> Σ Ri Xi ( i = 0...d )
	vector<T> func(const vector<T>& P, const vector<T>& Q){
		int d = A.size();
		vector<T> tmp(2*d-1, 0);
		for(int i=0; i<d; ++i){
			for(int j=0; j<d; ++j){
				tmp[i+j] += (P[i] * Q[j]);
				if(tmp[i+j] >= MOD) tmp[i+j] %= MOD;
			}
		}

		for(int i=2*d-2; i>=d; --i){
			for(int j=0; j<d; ++j){
				tmp[i - d + j] += (tmp[i] * A[j]);
				if(tmp[i - d + j] >= MOD) tmp[i - d + j] %= MOD;
			}
		}

		tmp.resize(d);
		return tmp;
	}

	T calc(T k){
		int d = A.size();

		int lg = 0;
		while((1LL<<lg) <= k) lg++;
		// X[2^n] = Σ B[n][i] X[i] (i = 0...d)
		vector<vector<T>> B(lg, vector<T>(d, 0));
		B[0][1] = 1;
		for(int i=0; i+1<lg; i++){
			B[i+1] = func(B[i], B[i]);
		}

		vector<T> res = B[0];
		int r = 0;
		while(k){
			if(k & 1){
				res = func(res, B[r]);
			}
			k>>=1;
			r++;
		}

		T ret = 0;
		for(int i=0; i<d; i++){
			ret += (res[i] * X[i]);
			ret %= MOD;
		}
		return ret;
	}
};


int main(){
	long long n;
	int p,c;
	cin >> n >> p >> c;

	int sz = 13*p + 12*c + 1;
	vector<vector<long long>> dp(p+c+1, vector<long long>(sz, 0));
	dp[0][0] = 1;
	for(int i=0; i<6; i++){
		for(int j=0; j<p; j++){
			for(int k=0; k<sz; k++){
				if(k+a[i] >= sz) continue;
				dp[j+1][k+a[i]] += dp[j][k];
				if(dp[j+1][k+a[i]] >= MOD) dp[j+1][k+a[i]] %= MOD;
			}
		}
	}

	for(int i=0; i<6; i++){
		for(int j=p; j<p+c; j++){
			for(int k=0; k<sz; k++){
				if(k+b[i] >= sz) continue;
				dp[j+1][k+b[i]] += dp[j][k];
				if(dp[j+1][k+b[i]] >= MOD) dp[j+1][k+b[i]] %= MOD;
			}
		}
	}

	vector<long long> A(sz, 0);

	for(int i=1; i<sz; i++){
		A[i-1] = dp[p+c][i];
	}

	reverse(A.begin(), A.end());

	vector<long long> X(sz, 1);

	kitamasa<long long> ktms(A,X);

	long long ans = ktms.calc(n+sz-2);

	cout << ans << endl;

	return 0;
}