#include <bits/stdc++.h>
using namespace std;
long long fac[1000010], finv[1000010], inv[1000010]; 
constexpr long long mod = 998244353; 
void COMinit(){
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for(int i = 2; i < 1000005; 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;
}
long long power(long long a, long long n){
	long long mul = a % mod; 
	long long res = 1; 
	for(int i = 0; i < 62; i++){
		if((n >> i) & 1){
			res *= mul; res %= mod; 
		}
		mul = mul * mul % mod; 
	}
	return res; 
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int N; long long M; cin >> N >> M; M = abs(M);
	long long inv4 = 748683265;
	long long bunbo = power(inv4, N);
	COMinit();
	if(M == 0 && N % 2 == 1){
		cout << 0 << "\n"; return 0;
	}else if(M == 0){
		long long a = COM(N, N/2);
		long long bunsi = (a * power(2, N+1) % mod + mod - a * a % mod) % mod;
		cout << bunsi * bunbo % mod << "\n";
		return 0;
	}
	vector<long long> div;
	for(long long i = 1; i * i <= M; i++){
		if(M % i) continue;
		div.push_back(i);
		if(i * i != M) div.push_back(M / i);
	}
	long long bunsi = 0;
	for(long long d : div){
		long long x = d; long long y = M / x;
		if(x > N || y > N) continue;
		if((N - x) % 2 || (N - y) % 2) continue;
		long long s = (N - x) / 2; long long t = (N - y) / 2;
		bunsi += COM(N, s) * COM(N, t) % mod; bunsi %= mod;
	}
	cout << bunsi * bunbo * 2 % mod << "\n";
}