#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
void tostr(ll x,string& res){while(x)res+=('0'+(x%10)),x/=10; reverse(ALL(res)); return;}
template<class T> inline bool chmax(T& a,T b){ if(a<b){a=b;return 1;}return 0; }
template<class T> inline bool chmin(T& a,T b){ if(a>b){a=b;return 1;}return 0; }
//end

template<unsigned mod=1000000007>struct mint {
   unsigned val;
   static unsigned get_mod(){return mod;}
   unsigned inv() const{
      int tmp,a=val,b=mod,x=1,y=0;
      while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y);
      if(x<0)x+=mod; return x;
   }
   mint():val(0){}
   mint(ll x):val(x>=0?x%mod:mod+(x%mod)){}
   mint pow(ll t){mint res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;}return res;}
   mint& operator+=(const mint& x){if((val+=x.val)>=mod)val-=mod;return *this;}
   mint& operator-=(const mint& x){if((val+=mod-x.val)>=mod)val-=mod; return *this;}
   mint& operator*=(const mint& x){val=ll(val)*x.val%mod; return *this;}
   mint& operator/=(const mint& x){val=ll(val)*x.inv()%mod; return *this;}
   mint operator+(const mint& x)const{return mint(*this)+=x;}
   mint operator-(const mint& x)const{return mint(*this)-=x;}
   mint operator*(const mint& x)const{return mint(*this)*=x;}
   mint operator/(const mint& x)const{return mint(*this)/=x;}
   bool operator==(const mint& x)const{return val==x.val;}
   bool operator!=(const mint& x)const{return val!=x.val;}
};
template<unsigned mod=1000000007>struct factorial {
   using Mint=mint<mod>;
   vector<Mint> Fact,Finv,Inv;
public:
   factorial(int maxx){
      Fact.resize(maxx+1),Finv.resize(maxx+1); Inv.resize(maxx+1);
      Fact[0]=Inv[1]=Mint(1); rep(i,0,maxx)Fact[i+1]=Fact[i]*(i+1);
      Finv[maxx]=Mint(1)/Fact[maxx]; rrep(i,maxx,0)Finv[i-1]=Finv[i]*i;
      rep(i,2,maxx+1)Inv[i]=Inv[mod%i]*(mod-mod/i);
   }
   Mint fact(int n,bool inv=0){if(inv)return Finv[n];else return Fact[n];}
   Mint inv(int n){return Inv[n];}
   Mint nPr(int n,int r){if(n<0||n<r||r<0)return Mint(0);else return Fact[n]*Finv[n-r];}
   Mint nCr(int n,int r){if(n<0||n<r||r<0)return Mint(0);else return Fact[n]*Finv[r]*Finv[n-r];}
}; using Mint=mint<>; using Factorial=factorial<>;

int a[]={2,3,5,7,11,13},b[]={4,6,8,9,10,12};
Mint dp[2][51][700],dp2[1350];

ll n; int m;
vector<Mint> v_mul(vector<Mint> a,vector<Mint> b){
   vector<Mint> res(2*m);
   rep(i,0,m)rep(j,0,m)res[i+j]+=a[i]*b[j];
   rrep(i,2*m-2,m-1)rep(j,1,m+1)res[i-j]+=dp2[j]*res[i];
   res.resize(m); return res;
}

int main(){
   int p,c; cin>>n>>p>>c;
   m=p*13+c*12; dp[0][0][0]=dp[1][0][0]=1;
   rep(k,0,6)rep(i,0,p)rep(j,0,p*13-a[k]+1)if(dp[0][i][j]!=0)dp[0][i+1][j+a[k]]+=dp[0][i][j];
   rep(k,0,6)rep(i,0,c)rep(j,0,c*12-b[k]+1)if(dp[1][i][j]!=0)dp[1][i+1][j+b[k]]+=dp[1][i][j];
   rep(i,0,p*13+1)rep(j,0,c*12+1)dp2[i+j]+=dp[0][p][i]*dp[1][c][j]; m++;
   vector<Mint> ret(m),mul(m); ret[0]=mul[1]=1; n+=m-1;
   while(n){
      if(n&1)ret=v_mul(ret,mul);
      mul=v_mul(mul,mul); n>>=1;
   }
   Mint res;
   rep(i,0,m)res+=ret[i],cerr<<ret[i].val<<endl;;
   printf("%d\n",res.val);
   return 0;
}