There is a checkered sheet of paper $n \times m$  $(n < m)$ with the cells colored black or white. Then a cylinder is obtained from this sheet by gluing together the two sides with lengths $m$ . Then a torus is obtained from the cylinder by gluing together the two circles (top and bottom) without twisting. The task is to compute the number of different colored tori, assuming that we cannot see the glued lines, and the torus can be turned and turned.
### Input
- A single line containing two positive integers $n,m.$
### Output
- Output the answer of the problem.
### Constraints
- $1 \le n < m \le 50.$
### Example
Input
```
2 3
```
Output
```
13
```
Input
```
6 9
```
Output
```
101964356
```
