#include<iostream>
#include<algorithm>
#include<stack>
#include<vector>
#include<set>

using namespace std;
using ll = long long;

#include<atcoder/modint>
using mint = atcoder::modint998244353;


const int mx = 2e6 + 10;
mint fac[mx],ifac[mx];
mint comb(int n,int r){
    return fac[n] * ifac[r] * ifac[n-r];
}

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

    ll n,m;
    cin>>n>>m;
    fac[0] = 1;
    for(int i = 1;i<mx;i++) fac[i] = fac[i-1] * i;
    for(int i = 0;i<mx;i++) ifac[i] = fac[i].inv();

    mint ans = 0;
    vector<pair<ll,ll>> use;
    for(ll i = 1;i*i<=m;i++){
        if(m%i!=0) continue;
        ll a = i;
        ll b = m / i;
        use.push_back(make_pair(a,b));
        use.push_back(make_pair(-a,-b));
        swap(a,b);
        use.push_back(make_pair(a,b));
        use.push_back(make_pair(-a,-b));
    }
    sort(use.begin(),use.end());
    use.erase(unique(use.begin(),use.end()),use.end());
    for(int i = 0;i<use.size();i++){
        auto now = use[i];
        ll a = now.first;
        ll b = now.second;
        a = abs(a);
        b = abs(b);
        ll all = n;
        if(n%2!=a%2) continue;
        if(n%2!=b%2) continue;
        ll x = (a+n) / 2;
        ll y = (b+n) / 2;
        if(x>n||y>n) continue;
        ans += comb(n,x) * comb(n,y);
    }
    ans /= mint(4).pow(n);
    cout<<ans.val()<<endl;
    
}