time limit per test: 0.25 sec. memory limit per test: 65536 KB
input: standard output: standard
On the planet Eisiem passenger tickets for the new mean of transportation are planned to have the form of tores.
Each tore is made of a single rectangular black rubber sheet containing N × M squares. Several squares are marked with white, thus encoding the ticket's source and destination.
When the passenger buys the ticket, the ticket booking machine takes the rubber sheet, marks some squares to identify the route of the passenger, and then provides it to the passenger. The passenger next must glue the ticket.
The ticket must be clued the following way. First two its sides of greater length are glued together, forming a cylinder. Next cylinder base circles, each of which has the length equal to the length of the short side of the original rubber sheet, are glued together. They must be glued in such a way, that the cells, sides of which are glued, first belonged to the same row of the sheet. Note that the inner and the outer part of the sheet can be distinguished.
The resulting tore is the valid ticket.
Note that if the original sheet is square, there are two topologically different ways to make a tore out of a rubber sheet.
Ticket material is so perfect and gluing quality is so fine, that no one is able to find the seam, and this leads to some problems. First, the same tore can be obtained using different sheets. More of that, the same sheet can lead to tores that look a bit different.
Now the transport companies of Eisiem wonder, how many different routes they can organize, so that the following conditions are satisfied:
tickets for different routes are represented by different tores;
if some rubber sheet was marked to make the tore for some route, it cannot be used to make the tore for another route.
Help them to calculate the number of routes they can organize.
The first line of the input file contains N and M (1 ≤ N, M ≤ 20).
Output the number of routes Eisiem transport companies can organize.
Petrozavodsk Summer Trainings 2003
Codeforces (c) Copyright 2010-2021 Mike Mirzayanov