A bus ticket with a -digit number is traditionally considered lucky if the sum of its first three digits equals the sum of its last three digits. Schoolboy Vasya loved getting lucky tickets, but it did not happen often. So, he decided to change the definition for himself: a ticket is considered lucky if the sum of some of its digits equals the sum of the remaining digits. For example, Vasya considers the ticket number lucky because 5 + 1 + 4 + 3 = 6 + 7.
As Vasya grew up, he continued to try to find lucky numbers in various document numbers. He extended his definition for -digit numbers composed of digits from to (1 \leq k \leq 9). A document number is considered lucky if the sum of some of its digits equals the sum of the remaining digits. All other numbers are considered unlucky. Despite the extended definition, many numbers still remain unlucky.
You are asked to determine the number of unlucky -digit numbers that can be formed using digits from to . Numbers may have any number of leading zeros.
The input contains several pairs of values and , each pair written on a separate line. 0 < n < 101
For each pair of values and in the input, print in a corresponding line of the output the required number of unlucky tickets, or if such a number cannot be obtained. The number of lines in the input and output files must be the same.
Example 1