output_description: Print the number of the sequences that contain an X,Y,Z-Haiku, modulo 10^9+7.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N X Y Z
attempt: N, X, Y, Z = map(int, input().split())
  mod = 10**9 + 7
  forbit = (1 << (X + Y + Z - 1)) + (1 << (Y + Z - 1)) + (1 << (Z - 1))
  mask = (1 << (X + Y + Z)) - 1
  s = set()
  for i in range(mask + 1):
      if i & forbit:
          s.add(i)
  dp = [[0] * (mask + 1) for i in range(N + 1)]
  dp[0][0] = 1
  for n in range(1, N + 1):
      for i in range(mask + 1):
          # if i in s:
          # continue
          for k in range(10):
              t = ((i << (k + 1)) | 1 << k) & mask
              # if t in s:
              # continue
              if (t & forbit) == forbit:
                  continue
              dp[n][t] += dp[n - 1][i]
              dp[n][t] %= mod
  ans = pow(10, N, mod)
  for i in range(mask + 1):
      # if i in s:
      # continue
      ans -= dp[N][i]
      ans %= mod
  print(ans)
  
problem_description: Statement
  
   _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.
samples: [{"input": "3 5 7 5", "output": "1\n    \n\nHere, the only sequence that contains a 5,7,5-Haiku is [5, 7, 5].\n\n* * *"}, {"input": "4 5 7 5", "output": "34\n    \n\n* * *"}, {"input": "37 4 2 3", "output": "863912418\n    \n\n* * *"}, {"input": "40 5 7 5", "output": "562805100"}]