#include <bits/stdc++.h>
using namespace std;
const int MXN = 160;
unsigned mol = 1e9 + 7;
inline void ad(unsigned& x, const unsigned& y) {
  if ((x += y) >= mol) x %= mol;
}
inline void ad(long long& x, const long long& y) {
  if ((x += y) >= mol) x -= mol;
}
int N, M;
void init() { scanf("%d%d", &N, &M); }
namespace solve {
unsigned answer = 0;
unsigned f[MXN][2][2][MXN][MXN] = {};
unsigned g[MXN][MXN];
void solve() {
  for (int i = 1; i <= M; i++) {
    memset(g, 0, sizeof(g));
    for (int x = N; x >= 1; x--)
      for (int y = x; y <= N; y++) g[x][y] = f[i - 1][0][0][x][y];
    for (int x = N; x >= 1; x--)
      for (int y = 1; y <= N; y++)
        ad(g[x][y], g[x + 1][y] + g[x][y - 1] + mol - g[x + 1][y - 1]);
    for (int x = N; x >= 1; x--)
      for (int y = x; y <= N; y++) f[i][0][0][x][y] = g[x][y] + 1;
    memset(g, 0, sizeof(g));
    for (int x = N; x >= 1; x--)
      for (int y = x; y <= N; y++)
        g[x][y] = (f[i - 1][0][0][x - 1][y] + f[i - 1][1][0][x][y]) % mol;
    for (int x = 1; x <= N; x++)
      for (int y = 1; y <= N; y++)
        ad(g[x][y], g[x - 1][y] + g[x][y - 1] + mol - g[x - 1][y - 1]);
    for (int x = N; x >= 1; x--)
      for (int y = x; y <= N; y++)
        f[i][1][0][x][y] = (g[x][y] + mol - g[x][x - 1]) % mol;
    memset(g, 0, sizeof(g));
    for (int x = N; x >= 1; x--)
      for (int y = x; y <= N; y++)
        g[x][y] = (f[i - 1][0][0][x][y + 1] + f[i - 1][0][1][x][y]) % mol;
    for (int x = N; x >= 1; x--)
      for (int y = N; y >= 1; y--)
        ad(g[x][y], g[x + 1][y] + g[x][y + 1] + mol - g[x + 1][y + 1]);
    for (int x = N; x >= 1; x--)
      for (int y = x; y <= N; y++)
        f[i][0][1][x][y] = (g[x][y] + mol - g[y + 1][y]) % mol;
    memset(g, 0, sizeof(g));
    for (int x = N; x >= 1; x--)
      for (int y = x; y <= N; y++)
        g[x][y] = (f[i - 1][0][0][x - 1][y + 1] + f[i - 1][0][1][x - 1][y] +
                   f[i - 1][1][0][x][y + 1] + f[i - 1][1][1][x][y]) %
                  mol;
    for (int x = 1; x <= N; x++)
      for (int y = N; y >= 1; y--)
        ad(g[x][y], g[x - 1][y] + g[x][y + 1] + mol - g[x - 1][y + 1]);
    for (int x = N; x >= 1; x--)
      for (int y = x; y <= N; y++) f[i][1][1][x][y] = g[x][y];
    for (int px = 0; px < 2; px++)
      for (int py = 0; py < 2; py++)
        for (int x = 1; x <= N; x++)
          for (int y = 1; y <= N; y++) ad(answer, f[i][px][py][x][y]);
  }
  cout << answer << endl;
}
}  // namespace solve
int main() {
  init();
  solve::solve();
  return 0;
}
