#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#include <atcoder/modint>
using mint=atcoder::modint998244353;
		
int main(){
	ll n,m;
	cin>>n>>m;
	if(n<=30&&(1<<(n-1))<m){
		cout<<0<<endl;
		return 0;
	}
	mint ans=((mint)2).pow(n)-1;
	mint ans2=1;
	mint c=((mint)2).pow(n-1);
	for(int i=1;i<=m-1;i++){
		ans*=c-i;
		ans/=i;
		ans2*=2*c-1-i+1;
		ans2/=i;
	}
	ans2*=2*c-1-m+1;;
	ans2/=m;
	//cout<<ans.val()<<" "<<ans2.val()<<endl;
	cout<<(ans2-ans).val()<<endl;
}