#include <bits/stdc++.h>
#define cs const
#define pb push_back

using namespace std;
using ll = long long ; 

cs int mod = 998244353; 

cs int N = 2e7 + 50;

int n, m; 

ll fc[N], ifc[N];


int ksm(int a, int b) {
    int c = 1; 
    for(; b; b >>= 1, a = (ll) a * a % mod) 
        if(b & 1) c = (ll) c * a % mod;
    return c; 
}

ll C(int n, int m) {
    if(n < 0 || m < 0 || n < m) return 0; 
    return fc[n] * ifc[m] % mod * ifc[n - m] % mod; 
}
ll F(int a, int b) {
    // 1/(1 -x) ^ b [x ^ a]
    if(a < 0) return 0; 
    return C(b - 1 + a, a);
}
void fc_init(int n) {
    fc[0] = ifc[0] = 1; 
    for(int i = 1; i <= n; i++) {
        fc[i] = (ll) fc[i - 1] * i % mod; 
    }
    ifc[n] = ksm(fc[n], mod - 2);
    for(int i = n - 1; i; i--) {
        ifc[i] = (ll) ifc[i + 1] * (i + 1) % mod; 
    }
}
int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    ios :: sync_with_stdio(0), cin.tie(0);
    cin >> n >> m; 
    -- m; 
    fc_init(n * 2); 

    ll ans = F(m, n + 1);
    for(int l = 1; ; l++) {
        int cur = l * (6 * l - 1);
        ans = (ans + F(m - cur, n + 1)) % mod; 
        cur += 2 * l;
        ans = (ans + F(m - cur, n + 1)) % mod;
        if(cur > m) break;
    }
    for(int l = 1; ; l++) {
        int cur = (2 * l - 1) * (3 * l - 2);
        ans = (ans + mod - F(m - cur, n + 1)) % mod; 
        cur += (2 * l - 1);
        ans = (ans + mod - F(m - cur, n + 1)) % mod;
        if(cur > m) break;
    }
    cout << (ll) ans * ifc[n] % mod << '\n';
}