#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef RUS_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef RUS_HOME
    freopen("input", "r", stdin);
    //freopen("output.txt", "w", stdout);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef RUS_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int MOD=1e9+7,N=2001,M=18,oo=1e18;

int dp[42][18][66][18];
vvi g[18][66][18][18];
int pw[42],antipw[42];

int binpow(int a,int n){
    int ans=1;
    while(n){
        if(n&1)
            ans=1LL*ans*a%MOD;
        a=1LL*a*a%MOD;
        n>>=1;
    }
    return ans;
}

vvi vec[3];
map<vi,int>mp[3];
vi sv;
void brute(int sum,int nm){
    if(sum==0){
        vec[nm].push_back(sv);
        return;
    }
    for(int i=1;i<=sum;i++){
        sv.push_back(i);
        brute(sum-i,nm);
        sv.pop_back();
    }
}


vi all;
void merge(int x,int y,int z){
    for(auto u:vec[0][x]){
        all.push_back(u);
    }
    for(auto u:vec[1][y]){
        all.push_back(u);
    }
    for(auto u:vec[2][z]){
        all.push_back(u);
    }
}


int n,x,y,z;

void smain() {


    for(int i=0;i<42;i++){
        if(!i){
            pw[i]=1;
        }else{
            pw[i]=1LL*pw[i-1]*10%MOD;
        }
        antipw[i]=binpow(pw[i],MOD-2);
    }

    cin>>n>>x>>y>>z;
    brute(x,0);
    brute(y,1);
    brute(z,2);
    for(int i=0;i<3;i++){
        for(int j=0;j<SZ(vec[i]);j++){
            mp[i][vec[i][j]]=j;
        }
    }

    vi sz(3);
    for(int i=0;i<3;i++)
        sz[i]=SZ(vec[i]);

    for(int j=0;j<sz[0];j++){
        for(int k=0;k<sz[1];k++){
            for(int l=0;l<sz[2];l++){
                all.clear();
                merge(j,k,l);
                int len=SZ(all);
                for(int s=0;s<len-1;s++){
                    vi kek;
                    int fz=-1,fy=-1,sm=0;
                    for(int d=s;d>=0;d--){
                        if(sm+all[d]>z&&sm<=z)
                            kek.clear();
                        if(sm+all[d]>z+y&&sm<=z+y)
                            kek.clear();
                        kek.push_back(all[d]);
                        sm+=all[d];
                        if(sm==z){
                            reverse(ALL(kek));
                            if(!mp[2].count(kek))
                                assert(0);
                            fz=mp[2][kek];
                            reverse(ALL(kek));
                        }
                        if(sm==z+y&&fz!=-1){
                            reverse(ALL(kek));
                            if(!mp[1].count(kek)){
                                watch(kek);
                                assert(0);
                            }
                            fy=mp[1][kek];
                            reverse(ALL(kek));
                        }
                    }
                    int nm;
                    if(sm<=z){
                        nm=2;
                    }else if(sm>z&&sm<=z+y&&fz!=-1){
                        nm=1;
                    }else if(sm>z+y&&sm<=x+y+z&&fz!=-1&&fy!=-1){
                        nm=0;
                    }else{
                        continue;
                    }

                    for(int d=0;d<sz[nm];d++){
                        if(SZ(vec[nm][d])<SZ(kek))
                            continue;
                        bool f=true;
                        for(int h=0;h<SZ(kek);h++){
                            if(vec[nm][d][SZ(vec[nm][d])-h-1]!=kek[h]){
                                f=false;
                                break;
                            }
                        }
                        if(!f)
                            continue;
                        if(nm==0){
                            g[j][k][l][s].push_back({d,fy,fz});
                        }else if(nm==1){
                            g[j][k][l][s].push_back({sz[0],d,fz});
                        }else{
                            g[j][k][l][s].push_back({sz[0],sz[1],d});
                        }
                    }
                }
            }
        }
    }



    int ans=0;

    for(int i=1;i<=n;i++){
        for(int j=0;j<sz[0];j++){
            for(int k=0;k<sz[1];k++){
                for(int l=0;l<sz[2];l++){
                    all.clear();
                    merge(j,k,l);
                    int len=SZ(all);
                    if(len>i)
                        continue;
                    int cur=pw[n-len];
                    for(int s=0;s<len-1;s++){
                        for(auto u:g[j][k][l][s]){
                            int lol=dp[i-len+s+1][u[0]][u[1]][u[2]];
                            cur=(cur-1LL*lol*antipw[len-s-1]%MOD+MOD)%MOD;
                        }
                    }

                    for(int s=1;s<=i-len;s++){
                        cur=(cur-1LL*dp[s][sz[0]][sz[1]][sz[2]]*antipw[len]%MOD+MOD)%MOD;
                    }
                    dp[i][j][k][l]=cur;
                    dp[i][sz[0]][k][l]=(dp[i][sz[0]][k][l]+cur)%MOD;
                    dp[i][sz[0]][sz[1]][l]=(dp[i][sz[0]][sz[1]][l]+cur)%MOD;
                    dp[i][sz[0]][sz[1]][sz[2]]=(dp[i][sz[0]][sz[1]][sz[2]]+cur)%MOD;
                }
            }
        }
        //cout<<dp[i][sz[0]][sz[1]][sz[2]]<<endl;
        ans=(ans+dp[i][sz[0]][sz[1]][sz[2]])%MOD;
    }
    cout<<ans;

}



Measured memory_bytes: 40996