Given a grid of height h and width w, you are asked to calculate the number of unique paths one can take to move from the top-left corner to the bottom-right corner. Youβre only allowed to move right and down.
o
β‘οΈ
γ €
γ €
β¬οΈ
γ €
γ €
γ €
γ €
γ €
γ €
x
Input
The input contains two integers h and w (1 β€ h, w β€ 100).
Output
The program should print the number of unique paths itβs possible to take from the top-left to the bottom-right corner of the grid. The output can be large, so the answer should be taken modulo .