#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 0;

#define int ll

unordered_map<int, int> mp;
void solve(int n, int m, int k)
{
    if (k > n)
    {
        cout << 0 << endl;
        return;
    }
    if (n == 1)
    {
        int ans = 0;
        if (k == 1)
        {
            ans = (2 * m + 1) * 2 * m;
        }
        cout << ans << endl;
        return;
    }
    else if (n == 2)
    {
        int ans = 0;
        if (k > 2)
        {
            cout << ans << endl;
            return;
        }
        else
        {
            if (k == 1)
            {
                int ans1 = 0;
                for (int i = -m; i <= m; i++)
                {
                    int a = i * i;
                    if (a > 4 * m)
                        continue;
                    if (a % 4 == 0)
                        ans1++;
                }
                cout << ans1 << endl;
                return;
            }
            if (k == 2)
            {
                int ans2 = 0;
                for (int i = 0; i <= m; i++)
                {
                    int a = i * i;
                    for (int j = i; j >= 1; j--)
                    {
                        int b = a - j * j;
                        if (b > 4 * m)
                            break;
                        if (b % 4 == 0)
                        {
                            ans2++;
                            if (i)
                                ans2++;
                        }
                    }
                    for (int j = i + 1;; j++)
                    {
                        int b = j * j - a;
                        if (b > 4 * m)
                            break;
                        if (b % 4 == 0)
                        {
                            ans2++;
                            if (i)
                                ans2++;
                        }
                    }
                }
                cout << ans2 << endl;
            }
        }
        return;
    }
    // n > 3
    auto make = [&](int x)
    {
        ll res = 1;
        for (int i = 1; i <= n; ++i)
            res = min(res * x, m * (x + 1ll) + 1);
        return res;
    };

    int mx = 0;
    vector<int> P(5e5 + 10);
    for (int x = 0;; x++)
    {
        P[x] = make(x);
        if (P[x] > m * x + m)
        {
            break;
        }
        mx = x;
    }
    int ans = 0;
    auto add = [&](int x)
    {
        mp[x]++;
        if (mp[x] == k)
        {
            ans++;
        }
        if (mp[x] == k + 1)
        {
            ans--;
        }
    };
    for (int i = -m; i <= m; i++)
    {
        mp.clear();
        for (int x = 0; x <= mx; x++)
        {
            int p = P[x];
            int b = -p - i * x;
            if (abs(b) <= m)
            {
                add(b);
            }
            if (x > 0)
            {
                if (n & 1)
                {
                    b = p + i * x;
                }
                else
                {
                    b = -p + i * x;
                }
                if (abs(b) <= m)
                    add(b);
            }
        }
    }

    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    int n, m, k;
    while (cin >> n >> m >> k)
        solve(n, m, k);
    return 0;
}