#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)

struct mint{
    static  constexpr int m=998244353;
    int x;
    mint():x(0){}
    mint(ll x_):x(x_%m){if(x<0)x+=m;}
    mint &operator+=(mint b){if((x+=b.x)>=m) x-=m;return *this;}
    mint &operator-=(mint b){if((x-=b.x)<0) x+=m;return *this;}
    mint &operator*=(mint b){x=(ll)(x)*b.x%m;return *this;}
    mint pow(ll e) const {
        mint r=1,b=*this;
        while(e){
            if(e&1) r*=b;
            b*=b;
            e/=2;
        }
        return r;
    }
    mint inv() const{
        return pow(m-2);
    }
    mint &operator/=(mint b){return *this *= b.inv();}
    friend mint operator+(mint a,mint b){return a+=b;}
    friend mint operator-(mint a,mint b){return a-=b;}
    friend mint operator*(mint a,mint b){return a*=b;}
    friend mint operator/(mint a,mint b){return a/=b;}
};

mint G=3;
void ntt(bool inv,vector<mint> &a){
    int n=a.size(),s=__lg(n);
    assert((1<<s)==n);
    static vector<mint> ep,iep;
    while(ep.size()<=s){
        ep.push_back(G.pow((G.m-1)>>ep.size()));
        iep.push_back(ep.back().inv());
    }
    vector<mint> b(n);
    rep(i,1,s+1){
        int w=(1<<(s-i));
        mint base = inv ? iep[i] : ep[i], now=1;
        for(int y=0;y<n/2;y+=w){
            rep(x,0,w){
                auto l=a[(y<<1)|x];
                auto r=now * a[(y<<1)|x|w];
                b[y|x]=l+r;
                b[y|x|n>>1]=l-r;
            }
            now*=base;
        }
        swap(a,b);
    }
}

vector<mint> mult(vector<mint> &a,vector<mint> &b){
    const int n=a.size(),m=b.size();
    int z=1;
    while(z<n+m-1) z<<=1;
    auto a2=a,b2=b;
    a2.resize(z),b2.resize(z);
    ntt(false,a2),ntt(false,b2);
    rep(i,0,z) a2[i]*=b2[i];
    ntt(true,a2);
    a2.resize(n+m-1);
    mint iz=mint(z).inv();
    for(int i=0;i<n+m-1;i++) a2[i]*=iz;
    return a2;
}

struct combination{
    vector<mint> fact_rev;
    vector<mint> fact;
    combination(int len){
        fact.resize(len+1);
        fact_rev.resize(len+1);
        fact[0]=1;
        rep(i,0,len) fact[i+1]=fact[i]*(i+1);
        fact_rev[len]=fact[len].inv();
        for(int i=len;i>0;i--) fact_rev[i-1]=fact_rev[i]*i;
    }
    mint FACT(int x){
        if(x<0) return 0;
        return fact[x];
    }
    mint FACT_R(int x) {
        if (x < 0) return 0;
        return fact_rev[x];
    }
    mint REV(int x){
        if(x<=0) return 0;
        return fact[x-1]*fact_rev[x];
    }
};

void solve(){
    ll N,M;
    cin>>N>>M;
    vector<mint> A(M+1),B(M+1),C(M+1);
    combination table(2*M+2*N+100);
    rep(i,0,M+1){
        A[i]=table.FACT(i)*table.FACT(i-1)*table.FACT_R(2*i);
        B[i]=table.REV(i+1)*table.FACT_R(i)*table.FACT_R(i)*table.FACT_R(N-2*i-1);
        C[i]=table.FACT(2*i+N-1)*table.FACT_R(i)*table.FACT_R(i-1);
    }
    C[0]=0;
    auto tmp=mult(B,C);
    mint ans=0;
    rep(i,1,M+1){
        ans+=A[i]*tmp[i];
    }
    ans.x++;
    ans.x=(ans.x%ans.m+ans.m)%ans.m;
    cout<<ans.x<<"\n";
}

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