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

#define llong long long 
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#define rand __rand
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());  // or mt19937_64
template<class T = int> T rand(T range = numeric_limits<T>::max()) { return (T)(rng() % range); }

#define CONCAT_(x, y) x##y/*{{{*/
#define CONCAT(x, y) CONCAT_(x, y)
#ifdef LOCAL_DEBUG   
int __db_level = 0;
bool __db_same_line = false;
#define clog cerr << string(!__db_same_line ? __db_level * 2 : 0, ' ')
struct debug_block {
    function<void()> fn;
    void print_name() { __db_same_line = true; fn(); clog << endl; __db_same_line = false;  }
    debug_block(function<void()> fn_): fn(fn_) { clog << "{ "; print_name(); ++__db_level; }
    ~debug_block() { --__db_level; clog << "} "; print_name(); }
};
#define DB(args...) debug_block CONCAT(dbbl, __LINE__)([=]{ clog << args; })
#define deb(...)  if (1) { (clog << "[" #__VA_ARGS__ "] = [" << __VA_ARGS__) << "]"; if (!__db_same_line) clog << endl; }
#else
#define clog if (0) cerr
#define DB(...)
#define deb(...)
#endif
template<class T>
ostream& operator,(ostream& out, const T& thing) { return out << ", " << thing; }
template<class U, class V>
ostream& operator<<(ostream& out, const pair<U, V>& p) { return (out << "(" << p.first, p.second) << ")"; }
template<class A, class B>
ostream& operator<<(ostream& out, const tuple<A, B>& t) { return (out << "(" << get<0>(t), get<1>(t)) << ")"; }
template<class A, class B, class C>
ostream& operator<<(ostream& out, const tuple<A, B, C>& t) { return (out << "(" << get<0>(t), get<1>(t), get<2>(t)) << ")"; }
template<class T> ostream& operator<<(ostream& out, const vector<T>& container) { 
    out << "{";
    if (len(container)) out << container[0];
    rep1(i, len(container) - 1) out, container[i];
    return out << "}";
}
template<class x> vector<typename x::value_type> $v(const x& a) { return vector<typename x::value_type>(a.begin(), a.end()); }
#define ptrtype(x) typename iterator_traits<x>::value_type
template<class u> vector<ptrtype(u)> $v(u a, u b) { return vector<ptrtype(u)>(a, b); }/*}}}*/
// ACTUAL SOLUTION BELOW ////////////////////////////////////////////////////////////

int get_last(int mask) {
    int ans = mask & - mask;
    return __builtin_ctz(ans) + 1;
}

const llong rem = (llong)(1e9 + 7);
const int maxn = 44;

int n, x[3];

bool check_mask(int mask) {
    int state = 2;
    int s = 0;
    while (mask) {
        int t = get_last(mask);
        mask >>= t;
        s += t;
        if (s < x[state]) continue;
        if (s > x[state]) return false;
        --state;
        s = 0;
        if (state == -1) return true;
    }
    return false;
}

llong dp[maxn][1 << 17];

int main(void) {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> x[0] >> x[1] >> x[2];
    
    const int s = x[0] + x[1] + x[2];
    const int cap = (1 << s) - 1;
    
    dp[0][0] = 1;
    rep1(i, n) {
        rep(mask, (1 << s)) {
            for (int dig = 1, new_mask = (mask << 1 | 1) & cap; dig <= 10; ++dig, (new_mask <<= 1) &= cap) {
                if (check_mask(new_mask)) continue;
                (dp[i][new_mask] += dp[i - 1][mask]) %= rem;
            }
        }
    }
    
    llong p10 = 1;
    rep(i, n) p10 = p10 * 10 % rem;
    llong sum_mask = 0;
    
    rep(mask, (1 << s)) {
        (sum_mask += dp[n][mask]) %= rem;
    }
    llong ans = (p10 + rem - sum_mask) % rem;
    cout << ans;

    return 0;
}

// Remember:
// - Multitest? REFRESHING the data!!!
// - Constrains for each set of data may differs. Should NOT USE the same max constant (maxn)
//   for all of them.
// vim: foldmethod=marker


Measured memory_bytes: 44512