Биномиальный коэффициент

Paths on a Grid

You have a piece of paper and you choose a rectangle of size n * m on it. Let's call this rectangle together with the lines it contains a grid. Starting at the lower left corner of the grid, you move your pencil to the upper right corner, taking care that it stays on the lines and moves only to the right or up. The result is shown on the left:

Really a masterpiece, isn't it? Repeating the procedure one more time, you arrive with the picture shown on the right. Now you wonder: how many different works of art can you produce?


Two positive integers n and m.


Print the number of different art works that can be generated using the procedure described above. You may safely assume that this number fits into a 64-bit signed integer.

Time limit 1 second
Memory limit 128 MiB
Input example #1
3 4
Output example #1
Input example #2
1 1
Output example #2
Author Михаил Медведев