Knight's Move - 2#4058
A rectangular board of size N \times M ( rows and columns) is given. A chess knight starts at the top-left corner and must reach the bottom-right corner of the board.
The knight moves according to the standard chess rules:
Your task is to calculate the number of distinct paths the knight can take to travel from the top-left to the bottom-right corner.
The input consists of two natural numbers and (1 \leq N,\, M \leq 50).
Output a single integer representing the number of possible ways for the knight to reach the bottom-right corner of the board.
Example 1