Dominoes#628
Given a rectangular board of size m \times n. Find the number of ways to completely cover it with dominoes (rectangles of size 1 \times 2).
Two integers and (1 \le m, n \le 10) are given in a single line.
Print the number of ways to completely cover the board with the given dominoes.
Example 1
Example 2