#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000000000

vector<mint> get(int n,vector<long long> x){
	vector dp(n+1,vector<mint>(140,0));
	dp[0][0] = 1;
	rep(i,6){
		vector ndp(n+1,vector<mint>(140,0));
		rep(j,n+1){
			rep(k,140){
				rep(l,n+1){
					if(j+l>n)break;
					int nj = j+l;
					int nk = k + x[i] * l;
					if(nk>140)break;
					ndp[nj][nk] += dp[j][k];
				}
			}
		}
		swap(dp,ndp);
	}
	return dp.back();
}

vector<mint> mul(vector<mint> a,vector<mint> b){
	
	vector<mint> c(a.size()+b.size()-1,0);
	rep(i,a.size()){
		rep(j,b.size()){
			c[i+j] += a[i]*b[j];
		}
	}
	return c;
	
	//return convolution(a,b);
}

//suppose m = a.size()
//for i, 
//x[i] = a[i](i<m)
//x[i] = x[i-1]*c[0] + x[i-2]*c[1] + ... + x[i-m]*c[m-1]
//return x[n-1]
mint Bostan_Mori(vector<mint> a,vector<mint> c,long long n){
	int d = c.size();
	rep(i,c.size()){
		c[i] *= -1;		
	}
	c.insert(c.begin(),1);
	a.insert(a.begin(),0);
	a = mul(a,c);
	while(a.size()>1+d)a.pop_back();
	
	while(n!=0){
		auto cinv = c;
		for(int i=1;i<cinv.size();i+=2)cinv[i] *= -1;
		a = mul(a,cinv);
		c = mul(c,cinv);
		
		{
			vector<mint> na;
			for(int i=(n&1LL);i<a.size();i+=2)na.push_back(a[i]);
			swap(a,na);
		}
		{
			vector<mint> nc;
			for(int i=0;i<c.size();i+=2)nc.push_back(c[i]);
			swap(c,nc);
		}
		
		n>>=1;
	}
	return a[0] / c[0];
}


int main(){	
	
	vector<long long> p = {2,3,5,7,11,13};
	vector<long long> c = {4,6,8,9,10,12};
	
	long long N,P,C;
	cin>>N>>P>>C;
	
	auto x = get(P,p);
	auto y = get(C,c);

	
	vector<mint> z(140,0);
	rep(i,140){
		rep(j,140){
			if(i+j<140){
				z[i+j] += x[i]*y[j];
			}
		}
	}
	//cout<<z[4].val()<<endl;
	z.erase(z.begin());
	mint ans = 0;
	vector<mint> aa(139,0);
	aa.back() = 1;
	for(int i=1;i<140;i++){
		long long n = N-i;
		if(n<0)break;
		mint temp;
		if(n>=0)temp = Bostan_Mori(aa,z,n+138+1);
		else temp = 1;
		
		
		mint sum = 0;
		for(int j=i;j<140;j++)sum += z[j-1];

		ans += sum * temp;
	}
	
	cout<<ans.val()<<endl;
	
	return 0;
	
}