#include <bits/stdc++.h>

using i64 = long long;

constexpr int P = 998244353;

int power(int a, int b) {
    int res = 1;
    for (; b; b /= 2, a = 1LL * a * a % P) {
        if (b % 2) {
            res = 1LL * res * a % P;
        }
    }
    return res;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int N, M;
    std::cin >> N >> M;

    const int L = N + M;
    std::vector<int> fac(L + 1), invfac(L + 1);
    fac[0] = 1;
    for (int i = 1; i <= L; i++) {
        fac[i] = 1LL * fac[i - 1] * i % P;
    }
    invfac[L] = power(fac[L], P - 2);
    for (int i = L; i > 0; i--) {
        invfac[i - 1] = 1LL * invfac[i] * i % P;
    }

    auto binom = [&](int n, int m) {
        return 1LL * fac[n] * invfac[m] % P * invfac[n - m] % P;
    };

    int ans = 0;
    for (int k = 0; k * (3 * k - 1) / 2 < M; k++) {
        int t = M - 1 - k * (3 * k - 1) / 2;
        ans = (ans + 1LL * binom(t + N, N) * (k % 2 ? P - 1 : 1)) % P;
        if (k > 0 && k * (3 * k + 1) / 2 < M) {
            int t = M - 1 - k * (3 * k + 1) / 2;
            ans = (ans + 1LL * binom(t + N, N) * (k % 2 ? P - 1 : 1)) % P;
        }
    }

    ans = 1LL * ans * invfac[N] % P;
    std::cout << ans << "\n";

    return 0;
}