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

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define char ll
//#define double ld
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 MAX_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 MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
#ifdef HK_CUP
    freopen("finput.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
#ifndef HK_CUP
    cout << "\n\nTOTAL EXECUTION TIME: " << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
#endif
    return 0;
}
const int L = 1e5 + 10;
int cnt = 2;
const int T = 11;
int g[L][T];
vi need_sum = {0, 0, 0};
int n;

bool cool[L];
int link[L];
int go[L][T];
int parent[L];
int parent_let[L];
vi anti_link[L];

void add_to_trie(vi a) {
    int v = 1;
    for (auto c : a) {
        if (!g[v][c]) {
            g[v][c] = cnt++;
            parent[g[v][c]] = v;
            parent_let[g[v][c]] = c;
        }
        v = g[v][c];
        if (cool[v])
            return;
    }
    cool[v] = true;
}

int get_go(int v, int c) {
    if (go[v][c])
        return go[v][c];
    if (g[v][c])
        return go[v][c] = g[v][c];
    return go[v][c] = get_go(link[v], c);
}

bool used[L];

void dfs(int v) {
    used[v] = true;
    cool[v] = true;
    for (int c = 1; c <= 10; ++c) {
        if (g[v][c] && !used[g[v][c]]) {
            dfs(g[v][c]);
        }
    }
    for (int to : anti_link[v]) {
        if (!used[to]) {
            dfs(to);
        }
    }
}

void build_automaton() {

    fori (dig, 11) {
        if (!g[1][dig])
            g[1][dig] = 1;
    }

    queue<int> q;
    q.push(1);
    used[1] = true;
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        if (v == 1 || parent[v] == 1) {
            link[v] = 1;
        } else {
            link[v] = get_go(link[parent[v]], parent_let[v]);
        }
        anti_link[link[v]].push_back(v);
        for (int c = 1; c <= 10; ++c) {
            if (g[v][c] && !used[g[v][c]]) {
                q.push(g[v][c]);
                used[g[v][c]] = true;
            }
        }
    }
    fill(used, used + cnt, false);

    for (int v = 1; v < cnt; ++v) if (!used[v] && cool[v]) {
        dfs(v);
    }
}

void rec(int i, vi a, int sum = 0) {
    if (i == 3) {
        add_to_trie(a);
        return;
    }
    if (sum == need_sum[i]) {
        rec(i + 1, a);
        return;
    }
    if (sum > need_sum[i])
        return;
    a.push_back(0);
    for (int dig = 1; dig <= 10; ++dig) {
        a.back() = dig;
        rec(i, a, sum + dig);
    }
}

const int N = 44;
int dp[N][L];

const int M = 1e9 + 7;

void insum(int &a, int b) {
    a = (a + b) % M;
}

void smain() {
    cin >> n;
    fori (z, 3) {
        cin >> need_sum[z];
    }

    rec(0, {});


    assert(cnt < L);

    build_automaton();

    dp[0][1] = 1;

    fori (i, n) {
        for (int v = 1; v < cnt; ++v) {
            for (int dig = 1; dig <= 10; ++dig) {
                int to = get_go(v, dig);
                if (cool[to]) {
                    insum(dp[i + 1][cnt], dp[i][v]);
                } else {
                    insum(dp[i + 1][to], dp[i][v]);
                }

            }
        }
        insum(dp[i + 1][cnt], (ll) dp[i][cnt] * 10 % M);
    }
    cout << dp[n][cnt];

}

Measured memory_bytes: 15120