#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll N,M;
ll mo=998244353;
ll comb(ll N_, ll C_) {
	const int NUM_=2400001;
	static ll fact[NUM_+1],factr[NUM_+1],inv[NUM_+1];
	if (fact[0]==0) {
		inv[1]=fact[0]=factr[0]=1;
		for (int i=2;i<=NUM_;++i) inv[i] = inv[mo % i] * (mo - mo / i) % mo;
		for (int i=1;i<=NUM_;++i) fact[i]=fact[i-1]*i%mo, factr[i]=factr[i-1]*inv[i]%mo;
	}
	if(C_<0 || C_>N_) return 0;
	return factr[C_]*fact[N_]%mo*factr[N_-C_]%mo;
}


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	M=abs(M);
	map<ll,ll> C;
	FOR(i,N+1) C[M+(1LL*i*i)]=i;
	
	ll ret=0;
	vector<pair<ll,ll>> V;
	for(x=0;x<=N;x++) if(C.count(1LL*x*x)) {
		ll X=x;
		ll Y=C[1LL*x*x];
		for(int px=x;px<=N;px++) {
			int mx=px-x;
			if((N-(px+mx+Y))%2) continue;
			int py=Y+(N-(px+mx+Y))/2;
			int my=N-px-py-mx;
			
			if(mx<0||py<Y||my<0) continue;
			assert(px-mx==X);
			assert(py-my==Y);
			assert(px+mx+py+my==N);
			ll a=comb(N,px+mx)*comb(px+mx,px)%mo*comb(py+my,my)%mo;
			if(px!=mx) a=a*2%mo;
			if(py!=my) a=a*2%mo;
			(ret+=a)%=mo;
		}
	}
	ll a=(mo+1)/2;
	a=a*a%mo;
	FOR(i,N) ret=ret*a%mo;
	cout<<ret<<endl;
	
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}