#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll mod=998244353;
ll qpow(ll a,ll b){
    if(b==0)return 1;
    ll ans=1;
    if(b%2)ans=a;
    ll t=qpow(a,b/2);
    return t*t%mod*ans%mod;
}
vector<ll>fact,ifact;
ll inv(ll a){
    return qpow(a,mod-2);
}
void init(int n){
    fact.resize(n+1),ifact.resize(n+1);
    fact[0]=1;
    for(int i=1;i<=n;i++){
        fact[i]=fact[i-1]*i%mod;
    }
    ifact[n]=inv(fact[n]);
    for(int i=n-1;i>=0;i--){
        ifact[i]=ifact[i+1]*(i+1)%mod;
    }
}
ll C(ll x,ll y){
    return fact[x]*ifact[x-y]%mod*ifact[y]%mod;
}
void solve(){
    ll n,m;
    cin>>n>>m;
    m--;
    vector<ll>a(n+1);
    init(2*n+2);
    for(ll k=0;k*(3*k-1)/2<=n;k++){
        ll x=k*(3*k-1)/2;
        if(k%2==0)
        a[x]+=1;
        else a[x]-=1;
    }
    for(ll k=-1;(k*(3*k-1)/2)<=n;k--){
        ll x=k*(3*k-1)/2;
        if(k%2==0)
        a[x]+=1;
        else a[x]-=1;
    }
    ll ans=0;
    // for(int i=0;i<=n;i++)cout<<a[i]<<' ';
    for(int i=0;i<=m;i++){
        ans+=a[m-i]*C(n+1-1+i,i)%mod;
    }

    ans%=mod;
    ans+=mod;
    ans%=mod;
    ans*=ifact[n];
    ans%=mod;
    cout<<ans<<'\n';

}
int main(){
    solve();
}