#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using db=double;
using pii=pair<int,int>;
#define endl "\n"
#define pb push_back
#define ull unsigned long long
#pragma GCC optimize(3,"Ofast","inline")
#define rep(i,l,r) for(int i = l;i <= r;i++)

const int N=1e6+10;
vector<int>fac[N];
ll mul(ll a,ll b) {
    ll res = a*b;
    if(res < -1e9)res = -1e9;
    if(res > 1e9)res = 1e9;
    return res;
}
ll qpow(ll a,ll b,ll m) {
    ll res = 1;
    while(b) {
        if(b&1)res = mul(res,a);
        a = mul(a,a);
        b >>= 1;
    }
    return res;
}

void solve(int n,int m,int k)
{
    ll ans = 0;
    if(n == 1) {
        if(k == 1)cout<<2ll*m*(2*m+1)<<'\n';
        else cout<<0<<'\n';
        return;
    }
    rep(b,-m,m) {
        map<int,int>cn;
        if(b == 0) {
            rep(a,-m,m)cn[a]++;
            rep(x,-m,m) {
                if(x == 0)continue;
                ll a = -qpow(x,n-1,m);
                if(abs(a) <= m)cn[a]++;
            }
        } else {
            for(auto x:fac[abs(b)]) {
                ll a = -b/x - qpow(x,n-1,m);
                if(abs(a) <= m)cn[a]++;
                x = -x;
                a = -b/x - qpow(x,n-1,m);
                if(abs(a) <= m)cn[a]++;
            }
        }
        for(auto x:cn)if(x.second == k)ans++;
    }
    cout<<ans<<'\n';
}


int main()
{
#ifdef ONLINE_JUDGE
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
#endif
    rep(i,1,N) {
        for(int j = i; j < N; j += i) {
            fac[j].push_back(i);
        }
    }
    int n,m,k;
    while(cin>>n>>m>>k) solve(n,m,k);
    return 0;
}