We have a chessboard, as the figure below, it shows the chessboard with dimension 1, 3, 5, 7 (We ignore the even number).Now, your task is to place K bishops on the n – dimension chessboard and satisfied that none of then attack each other ( A bishop can move to any distance in any of the four diagonal directions).

The input contains two integers n ( n < 100 && n % 2 == 1 )and k ( k <= 10000) separated by a single space.

Output the answer mod 100007.