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

struct solve{

    i64 Power(i64 a, i64 b, i64 lim) {
        i64 res = 1;
        for (; b; b /= 2, a *= a) {
            if (a > lim) return -1;
            if (b % 2) res *= a;
            if (res > lim) return -1;
        }
        return res;
    }

    vector<i64> Pow;
    solve(){
        int n, m, k;
        if(not (cin >> n >> m >> k)) exit(0);
        i64 ans = 0;

        if (n == 1) {
            if(k == 1) ans = 1LL * (2 * m + 1) * (2 * m);
            cout << ans << '\n';
            return;
        }

        if (n == 2) {
            if (k == 1) {
                for (i64 a = -m; a <= m; a++){
                    if (a * a > m * 4)continue;
                    if (a % 2 == 0) ++ans;
                }
            }else if(k == 2){
                auto CountEvenSqrt = [](i64 x) {
                    if (x < 0) return 0LL;
                    return i64(sqrtl(x / 4));
                };
                auto CountOddSqrt = [](i64 x) {
                    if (x < 0) return 0LL;
                    return i64(sqrt(x)) - i64(sqrtl(x / 4));
                };

                for (i64 a = -m; a <= m; a++) {
                    if (a % 2) ans += CountOddSqrt(a * a + 4 * m) - CountOddSqrt(a * a - 4 * m - 1);
                    else ans += CountEvenSqrt(a * a + 4 * m) - CountEvenSqrt(a * a - 4 * m - 1);
                }
            }
            cout << ans << '\n';
            return;
        }

        int max_x = 0;
        while (true){
            i64 fx = Power(max_x, n, 1LL * m * (max_x + 1));
            if (fx < 0) {max_x--; break;}
            Pow.push_back(fx), max_x ++;
        }

        unordered_map<int, int> occ;
        for (int a = -m; a <= m; a++) {
            occ.clear();
            occ[0] ++;
            for (int x = 1; x <= max_x; x++) {
                i64 b = Pow[x] - 1LL * a * x;
                if (abs(b) <= m) occ[b] ++;
                b = ((n % 2) ? -1 : 1) * Pow[x] + 1LL * a * x;
                if (abs(b) <= m) occ[b] ++;
            }
            for (auto [b, y] : occ) {
                if (y == k) ans ++;
            }
        }
        cout << ans << '\n';
    }
};

int main(){
    ios::sync_with_stdio(0);cin.tie(0); 
    while(true) solve() ;
    return 0;
}