Dima loves making pictures on a piece of squared paper. And yet more than that Dima loves the pictures that depict one of his favorite figures. 

A piece of squared paper of size *n* × *m* is represented by a table, consisting of *n* rows and *m* columns. All squares are white on blank squared paper. Dima defines a picture as an image on a blank piece of paper, obtained by painting some squares black.

The picture portrays one of Dima's favorite figures, if the following conditions hold:
 -  The picture contains at least one painted cell; -  All painted cells form a connected set, that is, you can get from any painted cell to any other one (you can move from one cell to a side-adjacent one); -  The minimum number of moves needed to go from the painted cell at coordinates (*x*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">1</sub>) to the painted cell at coordinates (*x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">2</sub>), moving only through the colored cells, equals |*x*<sub class="lower-index">1</sub> - *x*<sub class="lower-index">2</sub>| + |*y*<sub class="lower-index">1</sub> - *y*<sub class="lower-index">2</sub>|. 
Now Dima is wondering: how many paintings are on an *n* × *m* piece of paper, that depict one of his favorite figures? Count this number modulo 1000000007 (10<sup class="upper-index">9</sup> + 7).
The first line contains two integers *n* and *m* — the sizes of the piece of paper (1 ≤ *n*, *m* ≤ 150).
def count_paintings(n, m):
    dp = [[0 for i in range(m + 1)] for j in range(n + 1)]

    dp[1][1] = 1

    for i in range(2, n + 1):
        for j in range(2, m + 1):
            dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]

    return dp[n][m] % 1000000007

if __name__ == '__main__':
    n, m = map(int, input().split())

    print(count_paintings(n, m))