B'Vasily the Bear loves beautiful strings. String s is beautiful if it meets the following criteria: A modification of string with length at least two is the following operation: we replace two last characters from the string by exactly one other character. This character equals one if it replaces two zeros, otherwise it equals zero. For example, one modification transforms string "01010" into string "0100", two modifications transform it to "011". It is forbidden to modify a string with length less than two. Help the Bear, count the number of beautiful strings. As the number of beautiful strings can be rather large, print the remainder after dividing the number by 1000000007 (109 xe2 x80 x89+ xe2 x80 x897). The first line of the input contains three space-separated integers n, xe2 x80 x89m, xe2 x80 x89g (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105, xe2 x80 x89n xe2 x80 x89+ xe2 x80 x89m xe2 x80 x89 xe2 x89 xa5 xe2 x80 x891, xe2 x80 x890 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89g xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891). Print a single integer -- the answer to the problem modulo 1000000007 (109 xe2 x80 x89+ xe2 x80 x897). In the first sample the beautiful strings are: "01", "10". In the second sample the beautiful strings are: "0011", "1001", "1010", "1100". In the third sample there are no beautiful strings.'...