#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

int p[10], c[10];
int m, x, i0;
void dfs(ll t, int i) {
    if (i == i0) {
        x++;
        return;
    }
    for (int j = 0; j <= c[i]; j++) {
        dfs(t, i + 1);
        t *= p[i];
        if (t > m) break;
    }
}

int main() {
    int n, k;
    cin >> n >> k >> m;

    map<int, int> mp;
    int t = n;
    for (int i = 2; i * i <= t; i++) {
        while (t % i == 0) mp[i]++, t /= i;
    }
    if (t > 1) mp[t]++;

    int i = 0;
    for (auto &pi : mp) {
        ll t = (ll)pi.second * k;
        pi.second = (int)min(t, 1LL << 30);
        p[i] = pi.first;
        c[i] = pi.second;
        i++;
    }
    i0 = i;

    dfs(1, 0);

    cout << x << endl;

    return 0;
}