#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int n, m;
long long f[152][152][2][2];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++)
    for (int j = i; j <= m; j++) f[i][j][1][1] = 1;
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    long long res = 0;
    for (int l = 1; l <= m; l++)
      for (int r = l; r <= m; r++)
        for (int x = 0; x < 2; x++)
          for (int y = 0; y < 2; y++) res = (res + f[l][r][x][y]) % mod;
    ans = (ans + res * (n - i + 1)) % mod;
    for (int l = 1; l <= m; l++)
      for (int r = l + 1; r <= m; r++)
        for (int y = 0; y < 2; y++)
          f[l + 1][r][0][y] =
              (f[l + 1][r][0][y] + f[l][r][0][y] + f[l][r][1][y]) % mod;
    for (int l = 1; l <= m; l++)
      for (int r = m; r >= l + 1; r--)
        for (int x = 0; x < 2; ++x)
          f[l][r - 1][x][0] =
              (f[l][r - 1][x][0] + f[l][r][x][0] + f[l][r][x][1]) % mod;
    for (int l = m; l >= 2; l--)
      for (int r = l; r <= m; r++)
        for (int y = 0; y < 2; y++)
          f[l - 1][r][1][y] = (f[l - 1][r][1][y] + f[l][r][1][y]) % mod;
    for (int l = m; l >= 1; l--)
      for (int r = l; r < m; r++)
        for (int x = 0; x < 2; ++x)
          f[l][r + 1][x][1] = (f[l][r + 1][x][1] + f[l][r][x][1]) % mod;
  }
  printf("%lld\n", ans);
}
