#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }

using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

const int MAX_CH = 11;
const char F_CH = '0';
struct Node {
	bool last;
	int childs[MAX_CH];
	int prev;
	Node() {
		last = false;
		memset(childs, -1, sizeof(int) * MAX_CH);
		prev = 0;
	}
};

class aho_corasick {
	int add_node() {
		nodes.push_back(Node());
		return sz(nodes) - 1;
	}
public:
	vector<Node> nodes;

	aho_corasick() {
		clear();
	}

	void clear() {
		nodes.clear();
		add_node();
	}

	int add(const char* s) {
		int cur = 0;
		for (int i = 0; s[i]; i++) {
			int nxt = nodes[cur].childs[s[i] - F_CH];
			if (nxt == -1) {
				nxt = add_node();
				nodes[cur].childs[s[i] - F_CH] = nxt;
			}
			cur = nxt;
		}
		nodes[cur].last = true;
		return cur;
	}

	int go(int node_id, char c) {
		if (node_id == -1) return 0;
		while (node_id != -1) {
			if (nodes[node_id].childs[c] != -1) {
				return nodes[node_id].childs[c];
			} else {
				node_id = nodes[node_id].prev;
			}
		}
		return 0;
	}

	int go_internal(int node_id, char c) {
		if (node_id == -1) return 0;
		if (nodes[node_id].childs[c - F_CH] != -1) {
			return nodes[node_id].childs[c - F_CH];
		} else {
			return -1;
		}
	}

	//更にaddはしないものとして、failureを実行し、ahocorasick木を完成させる
	void constract_failure() {
		queue<int> q;
		q.push(0);
		nodes[0].prev = -1;
		while (!q.empty()) {
			int cur = q.front(); q.pop();
			FOR(i, MAX_CH) if (nodes[cur].childs[i] != -1) {
				int nxt = nodes[cur].childs[i];

				int prv = nodes[cur].prev;
				int n_prv = -1;
				while (n_prv == -1) {
					n_prv = go_internal(prv, i + F_CH);
					if (prv != -1) prv = nodes[prv].prev;
				}
				nodes[nxt].prev = n_prv;
				q.push(nxt);
			}
		}
	}

	int check(const char* s) {
		int cur = 0;
		for (int i = 0; s[i]; i++) {
			int nxt = nodes[cur].childs[s[i] - F_CH];
			if (nxt == -1) return false;
			cur = nxt;
		}
		return nodes[cur].last;
	}
};

const int MOD = ten(9) + 7;

vector<string> cand;
void dfs(string& cur, int sum, int x) {
	if (x == sum) {
		cand.push_back(cur);
		return;
	}
	FOR(i, 8) {
		if (i == 0) continue;
		int nsum = sum + i;
		bool ok = false;
		if (sum < x && nsum <= x) ok = true;
		if (!ok) continue;
		cur.push_back('0' + i);
		dfs(cur, nsum, x);
		cur.pop_back();
	}
}

ll dp[41][34000];

int main() {
	int n, x, y, z;
	reader(n, x, y, z);
	vector<string> ca, cb, cc;
	{
		string str;
		dfs(str, 0, x);
		ca = cand;
		cand.clear();
		dfs(str, 0, y);
		cb = cand;
		cand.clear();
		dfs(str, 0, z);
		cc = cand;
		cand.clear();
	}
	aho_corasick ac;
	for (auto& s1 : ca) {
		for (auto& s2 : cb) {
			for (auto& s3 : cc) {
				string tmp = s1 + s2 + s3;
				ac.add(tmp.c_str());
			}
		}
	}
	ac.constract_failure();


	int tmp = ac.go(ac.go(ac.go(0, 5), 7), 5);

	dp[0][0] = 1;
	FOR(i, n) {
		FOR(j, sz(ac.nodes)) {
			if (dp[i][j] == 0) continue;
			for (int k = 1; k <= 10; k++) {
				if (!ac.nodes[j].last) {
					int nj = ac.go(j, k);
					(dp[i + 1][nj] += dp[i][j]) %= MOD;
				} else {
					(dp[i + 1][j] += dp[i][j]) %= MOD;
				}
			}
		}
	}
	ll ans = 0;
	FOR(j, sz(ac.nodes)) if (ac.nodes[j].last) {
		ans += dp[n][j];
	}
	writerLn(ans % MOD);

	return 0;
}

Measured memory_bytes: 12016