#include<iostream>
#include<cstdio>
#include<queue>
#define int long long
#define mod 998244353
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int dp[205][105][105];
int jc[100005],njc[100005];
int ksm(int n,int k)
{
	int ans=1;
	while(k>=1)
	{
		if(k&1)ans=1LL*ans*n%mod;
		k>>=1;
		n=1LL*n*n%mod;
	}
	return ans;
}
int c(int n,int m)
{
	if(m<0||m>n)return 0;
	return 1LL*jc[n]*njc[m]%mod*njc[n-m]%mod;
}
signed main()
{
	int n,m;
	n=read();
	m=read();
	jc[0]=1;
	for(int i=1;i<=n+m;i++)jc[i]=1LL*jc[i-1]*i%mod;
	njc[n+m]=ksm(jc[n+m],mod-2);
	for(int i=n+m-1;i>=0;i--)njc[i]=1LL*njc[i+1]*(i+1)%mod;
	printf("%lld\n",1LL*c(n+m-1,n-1)%mod*c(n+m-2,n-1)%mod*njc[n]%mod*jc[n-1]%mod);
	return 0;
}