#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) ((y)<0||(x)<0||(y)>=(h)||(x)>=(w))
#define dump(...)
const signed INF_=1001001001; const ll INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}return 0;}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct{template<class T> operator T(){T x;cin>>x;return x;}} IN;
struct before_main_function {
    before_main_function() {
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

template <int mod = 1000000007>
class ModInt {
public:
    ModInt() : v(0) {}
    ModInt(int x) : v((x+mod)%mod) {}
    int value() const {return v;}
    const ModInt operator+(const ModInt &r) const { return ModInt(this->v + r.v); }
    const ModInt operator-(const ModInt &r) const { return ModInt(this->v + mod - r.v); }
    const ModInt operator*(const ModInt &r) const { return ModInt(this->v * r.v); }
    const ModInt operator/(const ModInt &r) const { return (*this * (~r)); }
    const ModInt operator~() const { return ModInt(bpow(this->v, mod-2)); }
    bool operator==(const ModInt &r) const { return this->v == r.v; }
    bool operator!=(const ModInt &r) const { return this->v != r.v; }
    ModInt& operator+=(const ModInt &r) { return *this = *this + r; }
    ModInt& operator-=(const ModInt &r) { return *this = *this - r; }
    ModInt& operator*=(const ModInt &r) { return *this = *this * r; }
    ModInt& operator/=(const ModInt &r) { return *this = *this * (~r); }
private:
    int v;
    int bpow(int a, int b) const {
        int ret = 1;
        while (b > 0) {
            if (b & 1) ret = (ret * a) % mod;
            a = (a * a) % mod;
            b >>= 1;
        }
        return ret;
    }
};
using Mint = ModInt<>;

int n;
int X,Y,Z;
int encode(const deque<int> &a) {
    int ret=0;
    FORE(x,a) {
        ret<<=x;
        ret|=1<<(x-1);
    }
    return ret;
}
deque<int> decode(int x) {
    deque<int> ret;
    int cnt=0;
    REP(i,17) {
        if((x>>i)&1) {
            ret.push_front(cnt+1);
            cnt=0;
        } else {
            cnt++;
        }
    }
    return ret;
}
int dp[41][1<<17];
Mint rec(int i,int sum) {
    if(dp[i][sum]!=INF) return dp[i][sum];
 
    deque<int> a=decode(sum);
    int s=0;
    int state=0;
    REP(x,SZ(a)) {
        s+=a[x];
        if(state==0 && s==X) state++;
        if(state==1 && s==X+Y) state++;
        if(state==2 && s==X+Y+Z) state++;
    }
    if(state==3) return dp[i][sum]=0;
    if(i==n) return dp[i][sum]=1;
 
    int bit=encode(a);
    Mint ret=0;
    REPF(x,1,11) {
        int next=bit;
        next<<=x;
        next|=1<<(x-1);
        int t=s+x;
        int len=32-__builtin_clz(next);
        while(len>X+Y+Z) {
            next^=1<<(len-1);
            len=32-__builtin_clz(next);
        }
        ret+=rec(i+1,next);
    }
    return dp[i][sum]=ret.value();
}
signed main() {
    REP(i,41) REP(j,1<<17) dp[i][j]=INF;

    cin>>n>>X>>Y>>Z;
    Mint ans=1;
    REP(i,n) ans*=10;
    cout<<(ans-rec(0,0)).value()<<endl;
    return 0;
}



Measured memory_bytes: 42240