Problem: Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.

Iroha is looking for X,Y,Z-Haiku (defined below) in integer sequences.

Consider all integer sequences of length N whose elements are between 1 and 10, inclusive. Out of those 10^N sequences, how many contain an X,Y,Z-Haiku?

Here, an integer sequence a_0, a_1, ..., a_{N-1} is said to contain an X,Y,Z-Haiku if and only if there exist four indices x, y, z, w (0 ≦ x < y < z < w ≦ N) such that all of the following are satisfied:

* a_x + a_{x+1} + ... + a_{y-1} = X
* a_y + a_{y+1} + ... + a_{z-1} = Y
* a_z + a_{z+1} + ... + a_{w-1} = Z



Since the answer can be extremely large, print the number modulo 10^9+7.

Constraints

* 3 ≦ N ≦ 40
* 1 ≦ X ≦ 5
* 1 ≦ Y ≦ 7
* 1 ≦ Z ≦ 5

Input

The input is given from Standard Input in the following format:


N X Y Z


Output

Print the number of the sequences that contain an X,Y,Z-Haiku, modulo 10^9+7.

Examples

Input

3 5 7 5


Output

1


Input

4 5 7 5


Output

34


Input

37 4 2 3


Output

863912418


Input

40 5 7 5


Output

562805100

Solution (in PYTHON3):

Solution:
n, x, y, z = map(int, input().split())
mod = 10 ** 9 + 7
simple_xyz = (1 << (x + y + z - 1)) | (1 << (y + z - 1)) | (1 << (z - 1))
def isnotxyz(b):
    return b & simple_xyz != simple_xyz
dp = [[0] * (1 << (x + y + z - 1)) for _ in range(n + 1)]
dp[0][0] = 1
for i in range(n):
    for b in range(1 << (x + y + z - 1)):
        if dp[i][b] == 0:
            continue
        for j in range(10):
            # 右から10...0(0はj個)を付け足し、(x + y + z)桁目より左の情報は忘れる
            new_b = ((b << 1 | 1) << j) & ((1 << (x + y + z)) - 1)
            if isnotxyz(new_b):
                new_b &= (1 << (x + y + z - 1)) - 1
                dp[i + 1][new_b] += dp[i][b]
                dp[i + 1][new_b] %= mod
def summod(a, mod):
    res = 0
    for ai in a:
        res += ai
        res %= mod
    return res
#俳句的でないほうの数を求めたので、全体から引く
print((pow(10, n, mod) - sum(dp[n])) % mod)