#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
#include<atcoder/modint>
using namespace std;
#include<vector>
template<typename T>
struct combination{
	vector<T>fac,ifac;
	combination(size_t N=0):fac(1,1),ifac(1,1)
	{
		make_table(N);
	}
	void make_table(size_t N)
	{
		if(fac.size()>N)return;
		size_t now=fac.size();
		N=max(N,now*2);
		fac.resize(N+1);
		ifac.resize(N+1);
		for(size_t i=now;i<=N;i++)fac[i]=fac[i-1]*i;
		ifac[N]=1/fac[N];
		for(size_t i=N;i-->now;)ifac[i]=ifac[i+1]*(i+1);
	}
	T factorial(size_t n)
	{
		make_table(n);
		return fac[n];
	}
	T invfac(size_t n)
	{
		make_table(n);
		return ifac[n];
	}
	T P(size_t n,size_t k)
	{
		if(n<k)return 0;
		make_table(n);
		return fac[n]*ifac[n-k];
	}
	T C(size_t n,size_t k)
	{
		if(n<k)return 0;
		make_table(n);
		return fac[n]*ifac[n-k]*ifac[k];
	}
	T H(size_t n,size_t k)
	{
		if(n==0)return k==0?1:0;
		return C(n-1+k,k);
	}
};
using mint=atcoder::modint998244353;
combination<mint>C;
int N;
mint inv2;
mint f(long t)
{
	t=abs(t);
	if(t%2!=N%2||t>N)return mint::raw(0);
	return C.C(N,(N-t)/2)*inv2;
}
int main()
{
	long M;
	cin>>N>>M;
	mint ans=0;
	inv2=mint::raw(2).pow(N).inv();
	if(M==0)
	{
		if(N%2==0)
		{
			mint g=C.C(N,N/2)*inv2;
			ans+=g;
			ans+=g;
			ans-=g*g;
		}
	}
	else
	{
		vector<pair<long,long> >XY;
		long aM=abs(M);
		for(long p=1;p*p<=aM;p++)if(aM%p==0)
		{
			if(M>0)
			{
				XY.push_back(make_pair(p,aM/p));
				XY.push_back(make_pair(-p,-aM/p));
				XY.push_back(make_pair(aM/p,p));
				XY.push_back(make_pair(-aM/p,-p));
			}
			else
			{
				XY.push_back(make_pair(p,-aM/p));
				XY.push_back(make_pair(-p,aM/p));
				XY.push_back(make_pair(aM/p,-p));
				XY.push_back(make_pair(-aM/p,p));
			}
		}
		sort(XY.begin(),XY.end());
		XY.erase(unique(XY.begin(),XY.end()),XY.end());
		for(pair<long,long>p:XY)
		{
			long x=p.first,y=p.second;
			ans+=f(x)*f(y);
		}
	}
	cout<<ans.val()<<endl;
}