#include <bits/stdc++.h>
#define N 1000011
using namespace std;
int n,m,pw[N],f[N],sf[N],ipw[N];const int p=998244353;
inline int qpow(int bs,int ex){int ans=1;while(ex){if(ex&1)ans=1ll*ans*bs%p;ex>>=1;bs=1ll*bs*bs%p;}return ans;}
int main()
{
	scanf("%d%d",&n,&m);
	pw[0]=1;for(int i=1;i<=n;++i)pw[i]=1ll*pw[i-1]*m%p;
	int im=qpow(m,p-2);
	ipw[0]=1;for(int i=1;i<=n;++i)ipw[i]=1ll*ipw[i-1]*im%p;
	for(int i=1;i<=n;++i)
	{
		f[i]=pw[i];
		f[i]=(f[i]-1ll*pw[i]*sf[i/2])%p;
		sf[i]=(sf[i-1]+1ll*f[i]*(i+i<=n?ipw[i+i]:1))%p;
	}
	int ex=(f[n]+(n%2==0?f[n/2]:0))%p;
	printf("%d\n",((pw[n]-ex)%p+p)%p);
}