

DominoesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 271 Accepted Submission(s): 136 Problem Description Some day, Tom's father buys him a box of dominoes blocks. In the box, there are 12 different blocks, which are shown above. Tom is a boy who likes to do practice in intelligence, so he spends a whole afternoon in finishing two different rectangles with 3 * 20, which are shown below. ¢Ù¢Ý¢Ý¢Ý¢Ý¢á¢â¢â¢â¢Þ¢Þ¢à¢Ú¢Ú¢Ú¢Ú¢Ú¢Û¢Ü¢Ü ¢Ù¢Ý¢Ð¢Ð¢á¢á¢á¢â¢Þ¢Þ¢ß¢à¢à¢à¢Ï¢Ï¢Û¢Û¢Û¢Ü ¢Ù¢Ù¢Ù¢Ð¢Ð¢Ð¢á¢â¢Þ¢ß¢ß¢ß¢ß¢à¢Ï¢Ï¢Ï¢Û¢Ü¢Ü ¢Ù¢à¢ß¢ß¢ß¢ß¢Þ¢â¢á¢Ð¢Ð¢Ð¢Ú¢Ú¢Ú¢Ú¢Ú¢Û¢Ü¢Ü ¢Ù¢à¢à¢à¢ß¢Þ¢Þ¢â¢á¢á¢á¢Ð¢Ð¢Ý¢Ï¢Ï¢Û¢Û¢Û¢Ü ¢Ù¢Ù¢Ù¢à¢Þ¢Þ¢â¢â¢â¢á¢Ý¢Ý¢Ý¢Ý¢Ï¢Ï¢Ï¢Û¢Ü¢Ü Tom is sure that these are the only solutions for 3 * 20, and he wants to know the number of solutions for 4 * 15, 5 * 12, ... Can you help him? You should notice that if a solution will be the same as the other by some flip or rotate, these two solutions should be consider as the same. Input There may be several test cases. Each contains a single line with two positive integers M and N, which means the shape of M * N. Here M * N = 60. Output For each test case, output a line contains the number of solutions. Sample Input
Sample Output
Source  
