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.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.Writer;
import java.io.InputStream;

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

class TaskD {
    final int MOD = (int) 1e9 + 7;

    public void solve(int testNumber, InputReader in, OutputWriter out) {
        int n = in.readInt();
        int m = in.readInt();
        int res = DPIn2DGrid.NumManhattanConnectedComponent(n, m, MOD);
        out.printLine(res);
    }
}

class InputReader {

    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;

    public InputReader(InputStream stream) {
        this.stream = stream;
    }

    public int read() {
        // InputMismatchException -> UnknownError
        if (numChars == -1)
            throw new UnknownError();
        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (IOException e) {
                throw new UnknownError();
            }
            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

    public int readInt() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        } else if (c == '+') {
            c = read();
        }
        int res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public static boolean isSpaceChar(int c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    }

class OutputWriter {
    private final PrintWriter writer;

    public OutputWriter(OutputStream outputStream) {
        writer = new PrintWriter(outputStream);
    }

    public OutputWriter(Writer writer) {
        this.writer = new PrintWriter(writer);
    }

    public void print(Object...objects) {
        for (int i = 0; i < objects.length; i++) {
            if (i != 0)
                writer.print(' ');
            writer.print(objects[i]);
        }
    }

    public void printLine(Object...objects) {
        print(objects);
        writer.println();
    }

    public void close() {
        writer.close();
    }

}

class DPIn2DGrid {
    public static int NumManhattanConnectedComponent(int n, int m, int MOD) {
        ModuloOperation mod = new ModuloOperation(MOD);
        int[][][][] f = new int[m][m][2][2];
        for (int i = 0; i < m; ++i) {
            for (int j = i; j < m; ++j) {
                f[i][j][0][0] = 1;
            }
        }
        int res = 0;
        for (int _n = 1; _n <= n; ++_n) {
            long count = 0;
            for (int a = 0; a < m; ++a) {
                for (int b = a; b < m; ++b) {
                    for (int ka = 0; ka <= 1; ++ka) {
                        for (int kb = 0; kb <= 1; ++kb) {
                            count += f[a][b][ka][kb];
                        }
                    }
                }
            }
            res = mod.add(res, mod.mod(count * (n - _n + 1)));
            for (int a = 0; a < m; ++a) {
                for (int b = a + 1; b < m; ++b) {
                    for (int kb = 0; kb <= 1; ++kb) {
                        f[a + 1][b][1][kb] = mod.add(f[a + 1][b][1][kb], f[a][b][1][kb]);
                        f[a + 1][b][1][kb] = mod.add(f[a + 1][b][1][kb], f[a][b][0][kb]);
                    }
                }
            }
            for (int a = 0; a < m; ++a) {
                for (int b = m - 1; b > a; --b) {
                    for (int ka = 0; ka <= 1; ++ka) {
                        f[a][b - 1][ka][1] = mod.add(f[a][b - 1][ka][1], f[a][b][ka][1]);
                        f[a][b - 1][ka][1] = mod.add(f[a][b - 1][ka][1], f[a][b][ka][0]);
                    }
                }
            }
            for (int a = m - 1; a >= 1; --a) {
                for (int b = a; b < m; ++b) {
                    for (int kb = 0; kb <= 1; ++kb) {
                        f[a - 1][b][0][kb] = mod.add(f[a - 1][b][0][kb], f[a][b][0][kb]);
                    }
                }
            }
            for (int a = m - 1; a >= 0; --a) {
                for (int b = a; b < m - 1; ++b) {
                    for (int ka = 0; ka <= 1; ++ka) {
                        f[a][b + 1][ka][0] = mod.add(f[a][b + 1][ka][0], f[a][b][ka][0]);
                    }
                }
            }
        }
        return res;
    }
}

class ModuloOperation {
    int MOD;
    public ModuloOperation(int mod) {
        MOD = mod;
    }
    public int add(int a, int b) {
        int res = a + b;
        if (res >= MOD) {
            res -= MOD;
        }
        return res;
    }
    public int mod(long a) {
        int res = (int) (a % MOD);
        if (res < 0) res += MOD;
        return res;
    }
}

