#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const long long HALF = 499122177;
int main(){
  int N;
  long long M;
  cin >> N >> M;
  vector<long long> inv(N + 1);
  inv[1] = 1;
  for (int i = 2; i <= N; i++){
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
  }
  vector<long long> fact(N + 1), finv(N + 1);
  fact[0] = 1;
  finv[0] = 1;
  for (int i = 1; i <= N; i++){
    fact[i] = fact[i - 1] * i % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
  long long P = 1;
  for (int i = 0; i < N * 2; i++){
    P *= HALF;
    P %= MOD;
  }
  long long ans = 0;
  for (long long Y = -N; Y <= N; Y++){
    long long XX = Y * Y + M;
    long long tv = 0, fv = 2000000;
    while (fv - tv > 1){
      long long mid = (tv + fv) / 2;
      if (mid * mid <= XX){
        tv = mid;
      } else {
        fv = mid;
      }
    }
    if (XX == tv * tv){
      long long X = tv;
      long long S = X + Y;
      long long D = X - Y;
      if ((N - S) % 2 == 0 && (N - D) % 2 == 0){
        if (-N <= S && S <= N && -N <= D && D <= N){
          long long add = P;
          add *= fact[N] * finv[(N + S) / 2] % MOD * finv[(N - S) / 2] % MOD;
          add %= MOD;
          add *= fact[N] * finv[(N + D) / 2] % MOD * finv[(N - D) / 2] % MOD;
          add %= MOD;
          if (X > 0){
            add *= 2;
            add %= MOD;
          }
          ans += add;
        }
      }
    }
  }
  ans %= MOD;
  cout << ans << endl;
}