#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#pragma warning(disable:4996) 

//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif

void solve()
{
    ll n, K, M;
    scanf("%lld%lld%lld", &n, &K, &M);
    if (M >= 3) {
        printf("0\n"); return;
    }

    ll cnt2 = 0;
    {
        double sumd = 1+K;
        ll sum = 1+K;
        ll curr = 1+K;
        while (1) {
            curr += K;
            sumd *= curr;
            sum *= curr;
            if (sumd < n * 10) {
                if (sum <= n) cnt2++;
            }
            else {
                break;
            }
        }
    }
    //printf("cnt2=%lld\n", cnt2);

    ll cnt1 = 0;
    int i, j;
    for (i = 2; i <= 25; i++) {
        ll l = 0, r = n;
        while (r - l > 1) {
            ll m = (l + r) / 2;
            int good = 0;
            double sumd = 1;
            ll sum = m;
            ll curr = m;
            for (j = 2; j <= i; j++) {
                curr += K;
                sumd *= curr;
                sum *= curr;
                if (sumd >= n * 10) {
                    break;
                }
            }
            if (j == i + 1) {
                if (sum <= n) good = 1;
            }
            if (good) {
                l = m;
            }
            else {
                r = m;
            }
        }
        //printf("i=%d, l=%d\n", i, l);
        cnt1 += l;
    }
    cnt1 -= cnt2 * 2;
    if (M == 2) {
        printf("%lld\n", cnt2);
    }
    else if (M == 1) {
        assert(false);
        printf("%lld\n", cnt1);
    }
    else {
        assert(false);
        printf("%lld\n", n - cnt2 - cnt1);
    }


    //assert(false);
    return;
}

int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //cout << "Case #" << t + 1 << ": ";
        solve();
    }
#endif
    return 0;
}