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 (x1, y1) to the painted cell at coordinates (x2, y2), moving only through the colored cells, equals |x1 - x2| + |y1 - y2|. 



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 (109 + 7).

Input

The first line contains two integers n and m — the sizes of the piece of paper (1 ≤ n, m ≤ 150).

Output

In a single line print the remainder after dividing the answer to the problem by number 1000000007 (109 + 7).

Examples

Input

2 2


Output

13


Input

3 4


Output

571
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author sheep
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskD solver = new TaskD();
		solver.solve(1, in, out);
		out.close();
	}
}

class Solver {

    final static int MOD = 1000000007;

    private int fix(int x) {
        if (x >= MOD) {
            x -= MOD;
        }

        if (x < 0) {
            x += MOD;
        }

        return x;
    }

    private int addMod(int x, int y) {
        return fix(x + y);
    }

    private int subMod(int x, int y) {
        return fix(x - y);
    }

    public int count(int n, int m) {

        int map[][] = new int[n][m];

        int dp[][][] = new int[m][m][4];
        for (int i = 0; i < m; ++i) {
            for (int j = i; j < m; ++j) {
                if (map[0][j] != 0) {
                    break;
                }

                dp[i][j][0] = 1;
            }
        }

        int ans = 0;

        for (int i = 1; i <= n; ++i) {

            for (int s = 0; s < 4; ++s) {
                for (int j = 0; j < m; ++j) {
                    for (int k = j; k < m; ++k) {
                        ans = addMod(ans, dp[j][k][s]);
                    }
                }
            }

            if (i == n) {
                break;
            }

            int next[][][] = new int[m][m][4];
            int suffixSum[][][] = new int[m][m][4];
            for (int s = 0; s < 4; ++s) {
                for (int j = 0; j < m; ++j) {
                    suffixSum[j][j][s] = dp[j][j][s];
                    for (int k = j - 1; k >= 0; --k) {
                        suffixSum[k][j][s] = addMod(suffixSum[k + 1][j][s], dp[k][j][s]);
                    }
                }
            }

            int prefixSum[][][] = new int[m][m][4];
            for (int s = 0; s < 4; ++s) {
                for (int j = 0; j < m; ++j) {
                    prefixSum[j][j][s] = dp[j][j][s];
                    for (int k = j + 1; k < m; ++k) {
                        prefixSum[j][k][s] = addMod(prefixSum[j][k - 1][s], dp[j][k][s]);
                    }
                }
            }

            for (int nowState = 0; nowState < 4; ++nowState) {
                for (int j = 0; j < m; ++j) {
                    for (int k = j; k < m; ++k) {
                        if (map[i][k] != 0) {
                            break;
                        }

                        next[j][k][nowState] = addMod(next[j][k][nowState], dp[j][k][nowState]);
                    }
                }

                if ((nowState & 3) == 0) {
                    for (int j = 0; j < m; ++j) {
                        int sum = 0;
                        for (int k = j; k < m; ++k) {
                            if (map[i][k] != 0) {
                                break;
                            }

                            next[j][k][0] = addMod(next[j][k][0], sum);
                            if (j + 1 < m) {
                                sum = addMod(suffixSum[j + 1][k][0], sum);
                            }
                        }
                    }
                }


                if ((nowState & 0) == 0) {
                    for (int j = 0; j < m; ++j) {
                        int sum = 0;
                        for (int k = j; k < m; ++k) {
                            sum = addMod(sum, subMod(suffixSum[0][k][nowState], suffixSum[j][k][nowState]));
                        }

                        for (int k = j; k < m; ++k) {
                            if (map[i][k] != 0) {
                                break;
                            }

                            sum = subMod(sum,  subMod(suffixSum[0][k][nowState], suffixSum[j][k][nowState]));
                            next[j][k][3] = addMod(next[j][k][3], sum);
                        }
                    }
                }

                if ((nowState & 1) == 0) {
                    for (int j = 0; j < m; ++j) {
                        int sum = 0, extraSum = 0;
                        sum = 0;
                        extraSum = 0;
                        for (int k = j; k >= 0; --k) {
                            if (map[i][k] != 0) {
                                break;
                            }

                            next[k][j][nowState | 2] = addMod(next[k][j][nowState | 2], sum);
                            next[k][j][nowState] = addMod(next[k][j][nowState], extraSum);
                            sum = addMod(sum, subMod(prefixSum[k][m - 1][nowState], prefixSum[k][j][nowState]));
                            extraSum = addMod(extraSum, dp[k][j][nowState]);
                        }
                    }
                }

                if ((nowState & 2) == 0) {
                    for (int j = 0; j < m; ++j) {
                        int sum = 0, extraSum = 0;
                        sum = 0;
                        extraSum = 0;
                        for (int k = j; k < m; ++k) {
                            if (map[i][k] != 0) {
                                break;
                            }

                            next[j][k][nowState | 1] = addMod(next[j][k][nowState | 1], sum);
                            next[j][k][nowState] = addMod(next[j][k][nowState], extraSum);
                            sum = addMod(sum, subMod(suffixSum[0][k][nowState], suffixSum[j][k][nowState]));
                            extraSum = addMod(extraSum, dp[j][k][nowState]);
                        }
                    }

                }

                {
                    for (int j = 0; j < m; ++j) {
                        int sum = 0;
                        for (int k = j; k >= 0; --k) {
                            if (map[i][k] != 0) {
                                break;
                            }

                            sum = subMod(prefixSum[k][m - 1][nowState], prefixSum[k][j][nowState]);
                            next[k][j][nowState | 2] = addMod(next[k][j][nowState | 2], sum);
                        }

                        sum = 0;
                        for (int k = j; k < m; ++k) {
                            if (map[i][k] != 0) {
                                break;
                            }

                            sum = subMod(suffixSum[0][k][nowState], suffixSum[j][k][nowState]);
                            next[j][k][nowState | 1] = addMod(next[j][k][nowState | 1], sum);
                        }
                    }

                }

            }

            dp = next;

            for (int j = 0; j < m; ++j) {
                for (int k = j; k < m; ++k) {
                    if (map[i][k] != 0) {
                        break;
                    }

                    dp[j][k][0] = addMod(dp[j][k][0], 1);
                }
            }
        }

        return ans;
    }
}

class TaskD {
    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int n = in.nextInt();
        int m = in.nextInt();
        Solver solver = new Solver();
        out.println(solver.count(n, m));
    }
}

class InputReader {
    BufferedReader reader;
    StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (Exception e) {
                throw new UnknownError();
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    }
