Tom and Jerry found a rectangular chocolate bar of size $$$n \times m$$$, consisting of square pieces $$$1 \times 1$$$. Tom allowed Jerry to perform any number (possibly zero) of the following actions:
Tom wants Jerry to obtain a chocolate bar with the maximum possible perimeter. If Jerry can solve this task, Tom will give him the chocolate bar, otherwise he will eat both Jerry and the chocolate bar.
Help Jerry determine the maximum possible perimeter the chocolate bar can have after several actions.
The first line contains two integers $$$n$$$ and $$$m$$$ separated by a space - the dimensions of the chocolate bar ($$$1 \le n, m \le 10^9$$$).
Output a single integer - the maximum possible perimeter of the chocolate bar.
Points for each subtask are awarded only if all tests for that subtask and the required subtasks are passed.
| Subtask | Points | Constraints | Required subtasks | Test information |
| 1 | 30 | $$$n \le 100$$$ | first error | |
| 2 | 30 | One side of the chocolate bar is a power of two | first error | |
| 3 | 40 | No additional constraints | 1, 2 | first error |
10 4
82
7 10
38
In the first example, Jerry can act as follows:
The final perimeter will be $$$40 \cdot 2 + 1 \cdot 2 = 82$$$.
| Name |
|---|


