#include <bits/stdc++.h>
using namespace std;
int n, m, sum[155][155][155][2][2], dp[155][155][155][2][2];
const int mod = 1000000007;
int mo(int x) {
  if (x < 0) x += mod;
  if (x >= mod) x -= mod;
  return x;
}
int add(int i, int l1, int r1, int l2, int r2, int o1, int o2) {
  i--;
  if (l1 > l2 || r1 > r2) return 0;
  int tmp = sum[i][l2][r2][o1][o2];
  tmp = mo(tmp + sum[i][l1 - 1][r1 - 1][o1][o2]);
  tmp = mo(tmp - sum[i][l1 - 1][r2][o1][o2]);
  tmp = mo(tmp - sum[i][l2][r1 - 1][o1][o2]);
  return tmp;
}
int main() {
  cin >> n >> m;
  memset(sum, 0, sizeof(sum));
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      for (int k = j; k <= m; k++) {
        dp[i][j][k][0][0] = 1;
      }
    }
    for (int j = 1; j <= m; j++) {
      for (int k = j; k <= m; k++) {
        dp[i][j][k][0][0] = mo(dp[i][j][k][0][0] + add(i, j, j, k, k, 0, 0));
        dp[i][j][k][0][1] = mo(dp[i][j][k][0][1] + add(i, j, k, k, m, 0, 1));
        dp[i][j][k][0][1] =
            mo(dp[i][j][k][0][1] + add(i, j, k + 1, k, m, 0, 0));
        dp[i][j][k][1][0] =
            mo(dp[i][j][k][1][0] + add(i, 1, j, j - 1, k, 0, 0));
        dp[i][j][k][1][0] = mo(dp[i][j][k][1][0] + add(i, 1, j, j, k, 1, 0));
        dp[i][j][k][1][1] =
            mo(dp[i][j][k][1][1] + add(i, 1, k + 1, j - 1, m, 0, 0));
        dp[i][j][k][1][1] =
            mo(dp[i][j][k][1][1] + add(i, 1, k, j - 1, m, 0, 1));
        dp[i][j][k][1][1] =
            mo(dp[i][j][k][1][1] + add(i, 1, k + 1, j, m, 1, 0));
        dp[i][j][k][1][1] = mo(dp[i][j][k][1][1] + add(i, 1, k, j, m, 1, 1));
      }
    }
    for (int j = 1; j <= m + 1; j++)
      for (int k = j; k <= m + 1; k++)
        for (int o1 = 0; o1 <= 1; o1++)
          for (int o2 = 0; o2 <= 1; o2++)
            sum[i][j][k][o1][o2] =
                mo(sum[i][j][k - 1][o1][o2] + dp[i][j][k][o1][o2]);
    for (int k = 1; k <= m + 1; k++)
      for (int j = 1; j <= m + 1; j++)
        for (int o1 = 0; o1 <= 1; o1++)
          for (int o2 = 0; o2 <= 1; o2++)
            sum[i][j][k][o1][o2] =
                mo(sum[i][j][k][o1][o2] + sum[i][j - 1][k][o1][o2]);
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      for (int k = j; k <= m; k++) {
        ans = mo(ans + dp[i][j][k][0][0]);
        ans = mo(ans + dp[i][j][k][0][1]);
        ans = mo(ans + dp[i][j][k][1][0]);
        ans = mo(ans + dp[i][j][k][1][1]);
      }
    }
  }
  cout << ans;
}
