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

const int N = 45;
const int M = (1 << 17) + 10;
const int MOD = 1e9 + 7;

int n, x, y, z;
int f[N][M];

void add(int &x,int y) { x = x + y < MOD ? x + y : x + y - MOD; }

int main() {
	ios_base::sync_with_stdio(false);
	cin >> n >> x >> y >> z;
	int needmask = (1 << (z - 1)) + (1 << (y + z - 1)) + (1 << (x + y + z - 1));
	int endmask = 1 << (x + y + z);
	
	f[0][0] = 1;
	for (int i = 1; i <= n; ++i) {
		for (int mask = 0; mask <= endmask; ++mask) {
			if (f[i - 1][mask] == 0) continue;
			
			for (int nxt = 1; nxt <= 10; ++nxt) {
				if (mask == endmask) {
					add(f[i][mask], f[i - 1][mask]);
					continue;
				}
				
				int nmask = ((mask << nxt) | (1 << (nxt - 1))) & (endmask - 1);
				if ((nmask & needmask) == needmask) nmask = endmask;
				add(f[i][nmask], f[i - 1][mask]);
			}
		}
	}
	cout << f[n][endmask];
}