#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}
 
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

int ans;

void dfs(vector<pair<ll, ll>> &vec, int p, int M, ll k) {
	if (p == vec.size()) {
		ans++;
		return;
	}

	dfs(vec, p + 1, M, k);

	ll x = vec[p].fi, c = vec[p].se;

	for (int i = 1; i <= c; ++i) {
		k *= x;
		if (k > M) break;
		dfs(vec, p + 1, M, k);
	}
}

int main() {
	int N, K, M; cin >> N >> K >> M;

	vector<pair<ll, ll>> vec;
	for (int i = 2; i * i <= N; ++i) {
		if (N % i == 0) {
			int c = 0;
			while (N % i == 0) {
				++c;
				N /= i;
			}
			vec.eb(i, c);
		}
	}
	if (N != 1) {
		vec.eb(N, 1);
	}

	rep(i, vec.size()) {
		vec[i].se *= K;
	}

	dfs(vec, 0, M, 1);
	cout << ans << endl;
	
	return 0;
}