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
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;

int n,x,y,z;
ll dp[44][1<<18];

int main(){
  cin>>n>>x>>y>>z;

  ll mask=0;
  mask|=(1<<z);
  mask|=(1<<(z+y));
  mask|=(1<<(z+y+x));
  
  ll checker=1<<(x+y+z+1);
  checker--;
  dp[0][1]=1;

  for(int i=0;i<n;i++){
    for(int S=0;S<checker;S++){
      for(int k=1;k<=10;k++){
        int nextS=((S<<k)&checker)+1;
        if((nextS&mask)==mask) continue;

        dp[i+1][nextS]+=dp[i][S];
        dp[i+1][nextS]%=MOD;
      }
    }
  }

  ll ans=1;
  for(int i=1;i<=n;i++){
    ans*=10;
    ans%=MOD;
  }

  for(int i=0;i<checker;i++){
    ans-=dp[n][i];
    ans%=MOD;
  }

  cout<<(ans+MOD)%MOD<<endl;

  return 0;
}
