#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
// #define int long long
#define pb push_back
#define fi first
#define se second
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define IO ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pii pair<int,int>
#define sz(x) (int)x.size()
const int mod = 1e9 + 7;
const int mod1 = 998244353;
typedef long double f80;

#ifndef LOCAL
#pragma GCC optimize ("O2")
#define endl '\n'
#endif

template<typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r){
    uniform_int_distribution<int> uid(l, r);
    return uid(rng);
}

ll pwr(ll a,ll b, ll mod){
    a %= mod;
    int ans = 1;
    while(b){
        if(b & 1) ans = (ans * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ans;
}

string to_string(string s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

const int N = 45;
map<vector<int>,int> dp[N];
int n, x, y, z;
bool strip(vector<int> &v){
	reverse(all(v));
	int s = 0;
	for(int p : v){
	    s += p;
	}
	while(s > x + y + z){
	    s -= v.back();
		v.pop_back();
	}
	while(!v.empty()){
		int c = 0, s = 0;
		bool pos = 1;
		for(int i = sz(v) - 1; i >= 0; i--){
			s += v[i];
			if(s == x) c++;
			if(s == x + y) c++;
			if(s > x && c < 1){
			    v.pop_back();
			    pos = 0;
			    break;
		    }
		    if(s > x + y && c < 2){
			    v.pop_back();
			    pos = 0;
			    break;
		    }
		}
		if(!pos) continue;
		reverse(all(v));
		return s == x + y + z;
	}
	return 0;
}
void solve(){
	cin >> n >> x >> y >> z;
	dp[0][{}] = 1;
	int ans = 0;
	fr(i, 0, n - 1){
		for(auto &v : dp[i]){
			fr(j, 1, 10){
				vector<int> v1 = v.fi;
				v1.pb(j);
				bool occ = strip(v1);
				if(!occ){
				    dp[i + 1][v1] += v.se;
				    if(dp[i + 1][v1] >= mod) dp[i + 1][v1] -= mod;
				}
				else{
				    ans += (pwr(10, n - i - 1, mod) * v.se) % mod;
				    if(ans >= mod) ans -= mod;
				}
			}
		}
	}
	cout << ans;
}
signed main(){
    IO;
    #ifdef LOCAL
        freopen("inp.txt","r", stdin);
        freopen("out.txt", "w", stdout);
    #endif
    cout << setprecision(10) << fixed;
    int t = 1;
    // cin >> t;
    fr(tt, 1, t){
        solve();
    }
    return 0;
}

Measured memory_bytes: 70784