A King Problem
Yi is an avid chess player. He would like to know how many ways it is possible to place \(K\) kings on an \(N \times N\) chessboard such that no king are in an attacking position.
Recall that a king can move to any adjacent cell (there are up to eight such cells). Thus, two kings are in the attacking position if they are located on the adjacent cells.
The first line will contain two integers \(N, K\) \((1 \le N \le 10, 1 \le K \le N^2)\).
The number of ways to place \(K\) kings on an \(N \times N\) chessboard such that no kings are in an attacking position.
Sample Input 1
Sample Output 1
Sample Input 2
Sample Output 2