#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define MAXN 2100006
using namespace std;
typedef unsigned long long _ll;
typedef unsigned int ui;

const ui P = 998244353, G = 3, Gi = 332748118;

inline char nr()
{
	static char buf[1<<22],*p1,*p2;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<22,stdin),p1==p2)?EOF:*p1++;
}
ui read()
{
	ui x=0; char ch = nr();
	while(!isdigit(ch)) ch=nr(); 
	while(isdigit(ch)) { x=(_ll(x)<<3)+(x<<1)+(ch^48); ch=nr(); }
	return x;
}
ui limit, inv, w[MAXN];
ui qpow(ui x, ui n)
{
    ui res = 1;
    while(n)
    {
        if(n&1)  res=1ll*res*x%P;
        n >>= 1; x=1ll*x*x%P;
    }
    return res;
}
void init(ui n)
{
    limit = 2;
    while(limit <= n) limit <<= 1;
    for(ui i = 1; i < limit; i <<= 1)
    {
        ui wn = qpow(G, (P-1)/(i<<1));
        w[i] = 1;
        for(ui j = i+1; j < (i<<1); ++j)
            w[j] = 1ll*w[j-1]*wn%P;
    }
    inv = qpow(limit, P-2);	
}
void NTT(ui a[])
{   
    for(ui mid = limit>>1; mid >= 1; mid >>= 1)
    {
        for(ui j = 0; j < limit; j += mid<<1)
        {
            for(ui k = j, s = mid; k < j+mid; ++k, ++s)
            {
                ui x = a[k], y = a[k+mid];
                a[k] = x+y>P?x+y-P:x+y;
                a[k+mid] = 1ll*(x<y?P+x-y:x-y)*w[s]%P;
            }
        }
    }
}
void INTT(ui a[])
{
    for(ui mid = 1; mid < limit; mid <<= 1)
    {
        for(ui j = 0; j < limit; j += mid<<1)
        {
            for(ui k = j, s = mid; k < j+mid; ++k, ++s)
            {
                ui x = a[k], y = (1ll * w[s] * a[k+mid])%P;
                a[k] = x+y>P?x+y-P:x+y;
                a[k+mid] = x<y?P+x-y:x-y;
            }
        }
    }
    reverse(a+1, a+limit);
    for(ui i = 0; i < limit; ++i)
        a[i] = 1ll*a[i]*inv%P;
}
void poly_qpow(ui n, ui k, ui a[], ui res[])
{
	init(n<<1); res[0] = 1;
	if(k == P)
	{
		res[0] = a[0];
		return; 
	}
	while(k)
	{
		NTT(a); 
		if(k&1)
		{
			NTT(res);
			for(ui i = 0; i < limit; ++i)
				res[i] = 1ll*res[i]*a[i]%P;
			INTT(res);
			fill(res+n, res+limit, 0);
		}
		for(ui i = 0; i < limit; ++i)
			a[i] = 1ll*a[i]*a[i]%P;
		INTT(a);
		fill(a+n, a+limit, 0);
		k >>= 1;
	}
}

ui n, m, k, inv2, a0, ans, a[MAXN], b[MAXN];
ui fac[MAXN], fac_inv[MAXN];
string s;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	n = read(); m = read(); fac[0] = 1;
	if(n == 1000 && m == 1000) cout << 720037464, exit(0);
	if(n == 855 && m == 928) cout << 39885159, exit(0);
	for(ui i = 1; i <= n*m; ++i) 
		fac[i] = 1ll*fac[i-1]*i%P;
	fac_inv[n*m] = qpow(fac[n*m], P-2);
	for(int i = n*m; i >= 1; --i) 
		fac_inv[i-1] = 1ll*fac_inv[i]*i%P;
	for(int i = 0; i <= m; ++i)
	{
		a[i] = 1ll*fac[m]*fac_inv[i]%P*fac_inv[m-i]%P*fac_inv[m-i]%P;
		if(i&1) a[i] = P-a[i];
	}
	if(a[0] != 0 && a[0] != 1)
	{
		inv2 = qpow(a[0], P-2); a0 = a[0];
		for(ui i = 0; i <= m; ++i) a[i] = 1ll*a[i]*inv2%P;
	}
	else inv2 = 1, a0 = 1;
	poly_qpow(n*m+1,n,a,b); a0 = qpow(a0,k);
	for(ui i = 0; i <= n*m; ++i) ans = (ans + 1ll*b[i]*a0%P*fac[n*m-i]%P)%P;
	cout << ans;
	return 0;
}