#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
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 qsm = [&](int a, int b)
    {
        int ans = 1;
        while (b)
        {
            if (b & 1)
            {
                using i64 = __int128_t;
                if ((i64)((i64)ans * a) > 1e18)
                {
                    return -1ll;
                }
                ans = ans * a;
                if ((i64)((i64)ans) > 1e18)
                {
                    return -1ll;
                }
            }
			using i64 = __int128_t;
			if ((i64)((i64)a * a) > 1e18)
            {
                return -1ll;
            }
            a = a * a;
            if ((i64)((i64)a) > 1e18)
            {
                return -1ll;
            }
            b >>= 1;
        }
        return ans;
    };
    int mx = 0;
    for (int x = 0;; x++)
    {
        if (qsm(x, n) == -1ll)
            break;
        if (qsm(x, n) > m * x + m)
        {
            break;
        }
        mx = x;
    }
    int ans = 0;
    auto make = [&](int a, int b)
    {
        return a * (int)(2e6) + b;
    };
    unordered_map<int, int> mp;
    for(int x1=-mx;x1<=mx;x1++)
    {
    	for(int x2=-mx;x2<x1;x2++)
    	{
    		int qss1 = qsm(x1, n);
    		int qss2 = qsm(x2, n);
    		int a=(qss1-qss2)%(x2-x1);
    		if(a!=0)
    		{
    			continue;
			}
			int b=(x1*qss2-x2*qss1)%(x2-x1);
			if(b!=0)
    		{
    			continue;
			}
			a=(qss1-qss2)/(x2-x1);
			b=(x1*qss2-x2*qss1)/(x2-x1);
			if (abs(a) <= m && abs(b) <= m)
            {
            	//cout<<a<<" "<<b<<endl;
            	if(mp[make(a, b)]==2&&k==2)
            	{
            		ans--;
				}
                mp[make(a, b)]+=2;
                if(mp[make(a, b)]==2&&k==2)
            	{
            		ans++;
				}
				if(mp[make(a, b)]==4&&k==3)
            	{
            		ans++;
				}
                mp[make(a, b)]=min(mp[make(a, b)],3ll);
            }
		}
	}
    for (int x = 1; x <= mx; x++)
    {
        int qss = qsm(x, n);
        int l = (-m - qss) / x;
        int r = (m - qss) / x;
        if (l > r)
            swap(l, r);
        for (int a = l; a <= r; a++)
        {
            // unordered_map<int, int> mp;
            int b = -a * x - qss;

            if (abs(a) <= m && abs(b) <= m)
            {
            	if(!mp.count(make(a, b))&&k==1)
            	{
            		ans++;
				}
            }
        }
        x=0-x;
        if(n&1) qss=0-qss;
        l = (-m - qss) / x;
        r = (m - qss) / x;
        if (l > r)
            swap(l, r);
        for (int a = l; a <= r; a++)
        {

            // unordered_map<int, int> mp;
            int b = -a * x - qss;

            // if(a==-1&&b==0) cout<<"! "<<endl;
            if (abs(a) <= m && abs(b) <= m)
            {
                if(!mp.count(make(a, b))&&k==1)
            	{
            		ans++;
				}
            }
        }
        x=0-x;
    }
    int x = 0;
    for (int a = -m; a <= m; a++)
    {
        // unordered_map<int, int> mp;
        int b = 0;
        if (abs(a) <= m)
        {
            if(!mp.count(make(a, b))&&k==1)
            {
            	ans++;
			}
        }
    }

    cout << ans << endl;
    //cout<<mp.size();
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m, k;
    while(cin >> n >> m >> k)
    {
    	solve(n, m, k);
	}
    return 0;
}