#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

constexpr int FACT_SIZE = 1000000;
mint Fact[FACT_SIZE + 1];
mint iFact[FACT_SIZE + 1];
const auto fact_init = [] {
    Fact[0] = mint::raw(1);
    for(int i = 1; i <= FACT_SIZE; ++i) {
        Fact[i] = Fact[i-1] * i;
    }
    iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();
    for(int i = FACT_SIZE; i; --i) {
        iFact[i-1] = iFact[i] * i;
    }
    return false;
}();

mint comb(int n, int k) {
    if (k == 0) return mint::raw(1);
    assert(n >= 0 && k >= 0);
    if (k > n) return mint::raw(0);
    return Fact[n] * iFact[n - k] * iFact[k];
}

mint icomb(int n, int k) {
    return iFact[n] * Fact[n - k] * Fact[k];
}

mint fact(int n) {return Fact[n];}
mint perm(int n, int k) {
    assert(0 <= n);
    return Fact[n] * iFact[n - k];
}

mint dp[305][305][305];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  dp[0][0][0] = 1;
  rep(i, n) {
    for(int c0 = 0; c0 <= i; c0++) {
      for(int c1 = 0; c0 + c1 <= i; c1++) {
        int c2 = i - (c0 + c1);
        mint v = dp[c0][c1][c2];
        if (!v.val()) continue;
        // 0
        dp[c0+1][c1][c2] += v;
        // 1, c0
        if (c0) dp[c0-1][c1+2][c2] += v * c0;
        // 1, c1
        if (c1) dp[c0][c1][c2+1] += v * c1;
        // 2, c0 c0
        if (c0 >= 2) dp[c0-2][c1+2][c2+1] += v * comb(c0, 2);
        // 2, c0 c1
        if (c0 >= 1 && c1 >= 1) dp[c0-1][c1][c2+2] += v * c0 * c1;
        // 2, c1 c1
        if (c1 >= 2) dp[c0][c1-2][c2+3] += v * (comb(c1, 2) - c1 / 2);
      }
    }
  }
  mint ans;
  for(int c0 = 0; c0 <= n; c0++) {
    for(int c1 = 1; c0 + c1 <= n; c1++) {
      int c2 = n - (c0 + c1);
      int e = (c1 + 2 * c2);
      if (e % 2) continue;
      e /= 2;
      e = n * (n - 1) / 2 - e;
      if (e == m) {
        ans += dp[c0][c1][c2];
      }
    }
  }
  cout << ans.val() << '\n';
}