A.Chess

Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)

Total Submission(s) : 25 Accepted Submission(s) : 14

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

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).

Input

输入包含两个整数n(n < 100 & & n % 2 = = 1)和k(k < = 10000)之间用一个空格分开。

Output

输出的答案mod 100007.

Sample Input

7 3
1 1

Sample Output

1038
1

Author

syu

Source

Developing School's Contest 6

Statistic | Submit | Back