{"raw_statement":[{"iden":"problem statement","content":"_Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order._\nIroha is looking for _$X,Y,Z$\\-Haiku_ (defined below) in integer sequences.\nConsider 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?\nHere, 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:\n\n*   $a_x + a_{x+1} + ... + a_{y-1} = X$\n*   $a_y + a_{y+1} + ... + a_{z-1} = Y$\n*   $a_z + a_{z+1} + ... + a_{w-1} = Z$\n\nSince the answer can be extremely large, print the number modulo $10^9+7$."},{"iden":"constraints","content":"*   $3 ≦ N ≦ 40$\n*   $1 ≦ X ≦ 5$\n*   $1 ≦ Y ≦ 7$\n*   $1 ≦ Z ≦ 5$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $X$ $Y$ $Z$"},{"iden":"sample input 1","content":"3 5 7 5"},{"iden":"sample output 1","content":"1\n\nHere, the only sequence that contains a $5,7,5$\\-Haiku is $[5, 7, 5]$."},{"iden":"sample input 2","content":"4 5 7 5"},{"iden":"sample output 2","content":"34"},{"iden":"sample input 3","content":"37 4 2 3"},{"iden":"sample output 3","content":"863912418"},{"iden":"sample input 4","content":"40 5 7 5"},{"iden":"sample output 4","content":"562805100"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}