Junyi is an avid chess player. He would like to know how many ways it is possible to place \(K\) rooks on an \(N \times N\) chessboard such that no rook are in an attacking position.
A rook can only move horizontally and vertically from its current position and two rooks are in an attacking position if one is on the path of the other.
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\) rooks on an \(N \times N\) chessboard such that no rooks are in an attacking position.