Pinaki wants to go to his home the map of city is a matrix of dimensions nxm. Initially pinaki is standing at (1,1) and his home is located at (n,m)

Pinaki can take moves of two types, He can move to right neighbouring cell or can move to the down neighbouring cell.also he does not want to take right moves consecutively while going to home. He wants to calculate the number of ways to reach home if he does not take two consecutive right steps.

As the number of ways may be large so print the answer modulo \(10^{9}\)+7(1000000007).

Input:

The only line conatins n and m dimensions of grid;

The Top left cell is (1,1) and bottom right cell is (n,m).

Output:

Print the number of ways to reach home by not taking two consecutive right steps.

Constraints:

1 ≤ n ≤ \(10^{3}\)

1 ≤ m ≤ \(10^{3}\)