#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;

ll n, k, m;
vector<pair<ll, ll>> e;

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

	return ret;
}

int dfs(ll a, ll b) {
	if (a == e.size()) return 1;

	int cnt = 0;
	ll t = 1;
	rep(i, e[a].second + 1) {
		cnt += dfs(a + 1, b * t);
		t *= e[a].first;
		if (t * b > m) break;
	}
	return cnt;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> k >> m;

	auto fact = prime_factor(n);
	for (auto& p : fact) e.push_back({ p.first,p.second * k });

	dunk(dfs(0, 1));

	return 0;
}