#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
constexpr int MAXN = 1e7 + 10, MOD = 998244353;
int qpow(int x, int y) {
  int ret = 1;
  for (; y; y >>= 1, x = (ll)x * x % MOD)
    if (y & 1) ret = (ll)ret * x % MOD;
  return ret;
}
int fac[MAXN * 2], ifac[MAXN * 2];
int C(int x, int y) {
  if (x < y || y < 0) return 0;
  return (ll)fac[x] * ifac[y] % MOD * ifac[x - y] % MOD;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int m, n;
  cin >> n >> m;
  fac[0] = 1;
  for (int i = 1; i <= n + m; ++i) fac[i] = (ll)fac[i - 1] * i % MOD;
  ifac[n + m] = qpow(fac[n + m], MOD - 2);
  for (int i = n + m - 1; i >= 0; --i)
    ifac[i] = (ll)ifac[i + 1] * (i + 1) % MOD;
  int ans = C(m - 1 + n, n);
  for (int i = 1; i * (i * 3 - 1) / 2 < m; ++i) {
    ans = (ans + (C(m - 1 - i * (i * 3 - 1) / 2 + n, n) +
                  C(m - 1 - i * (i * 3 + 1) / 2 + n, n)) *
                     (i & 1 ? -1ll : 1ll)) %
          MOD;
  }
  cout << (ll)(ans + MOD) * ifac[n] % MOD << "\n";
  return 0;
}
/*
g++ A.cpp -o A -O2 -std=c++14 -Wall -Wextra -Wshadow -g
-fsanitize=address,undefined
*/