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

ll modpow(ll a, ll e, ll m){
    ll r = 1;
    while (e){
        if (e&1) r = r*a%m;
        a = a*a%m;
        e >>= 1;
    }
    return r;
}

int main(){
    ll N, B;
    cin >> N >> B;
    vector<ll> M(B), L(B, 0);
    for (ll n = 0; n < B; n++){
        ll x = modpow(n, N, B);
        M[n] = x, L[x]++;
    }

    ll ans = 0;
    for (ll x = 0; x < B; x++){
        for (ll y = 0; y < B; y++){
            ans += L[x]*L[y]*L[(x+y)%B];
        }
    }

    cout << ans << endl;
}