#include<iostream>
#include<atcoder/modint>
using namespace std;
using mint=atcoder::modint998244353;
int N,M;
mint f(int k,int M)
{
	if(k==-1)return 1;
	if(M>>k&1)return mint(N+1).pow(k)+f(k-1,M)*N;
	else return f(k-1,M);
}
main()
{
	cin>>N>>M;
	cout<<f(29,M).val()<<endl;
}