#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#define LL long long
const LL mod = 1e9 + 7;
LL dp[41][1 << 17];//現在地、前の数字
int n, x, y, z;
int main() {
	std::cin >> n >> x >> y >> z;
	int xyz = (1 << (x + y + z - 1)) + (1 << (y + z - 1)) + (1 << (z - 1));
	dp[0][0] = 1;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < (1 << x+y+z); j++) {
			for (int k = 0; k < 10; k++) {
				int ac = j << (k + 1) | 1 << k;
                ac &= (1<<(x+ y+z))-1;
				if ((ac&xyz)==xyz)continue;                
				dp[i + 1][ac] += dp[i][j];
				dp[i + 1][ac] %= mod;
			}
		}
	}
	LL ans = 0;
	for (int i = 0; i < (1 << (x+y+z)); i++) {
		ans += dp[n][i];
		ans %= mod;
	}
    LL all=1;
    for(int i=0;i<n;i++){
        all*=10;
        all%=mod;
    }
    ans=all-ans;
    if(ans<0)ans+=mod;
	std::cout << ans << std::endl;
	return 0;
}