// g++ 1.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

const int MAX=1010000;
const long long MOD=998244353;

long long fac[MAX],finv[MAX],inv[MAX];

void COMinit(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%MOD;
    inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
    finv[i]=finv[i-1]*inv[i]%MOD;
  }
}

long long COM(int n,int k){
  if(n<k) return 0;
  if(n<0||k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}

using mint = modint998244353;

mint four;

mint sub(ll n,ll x,ll y){
  //cout<<n<<" "<<x<<" "<<y<<endl;
  if((n-x-y)%2==1)return 0;
  mint res=four;
  res*=COM(n,(n+x-y)/2);
  res*=COM(n,(n-x-y)/2);
  return res;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  COMinit();

  ll n,m;cin>>n>>m;

  four=inv_mod(pow_mod(4,n,MOD),MOD);

  mint ans=0;

  rep(x,-n-10,n+10){
    ll ysq=x*x-m;
    if(ysq<0)continue;
    if(ysq==0){
      ans+=sub(n,x,0);
    }
    else{
      ll ysq2=sqrt(ysq);
      rep(y,ysq2-5,ysq2+5){
        if(y*y==ysq&&y>0){
          ans+=2*sub(n,x,y);
        }
      }
    }
  }

  cout<<ans.val()<<endl;
}