#include <bits/stdc++.h>
#define Int int64_t

using namespace std;
using P = pair<Int, Int>;

template <typename T>
vector<pair<T, T>> prime_factorize(T n) {
	vector<pair<T, T>> ret;

	for (T p = 2; p * p <= n; p++) {
		if (n % p != 0) { continue; }

		T num = 0;
		while (n % p == 0) {
			num++;
			n /= p;
		}
		ret.push_back(P(p, num));
	}
	if (n != 1) ret.push_back(P(n, 1));

	return ret;
}

int main() {
	Int N, K, M;
	cin >> N >> K >> M;
	vector<P> v = prime_factorize(N);

	vector<Int> res;
	res.emplace_back(1);
	vector<Int> tmp;
	for (int i = 0; i < v.size(); ++i) {
		Int f = v[i].first, s = v[i].second;
		for (auto val : res) {
			tmp.emplace_back(val);
			Int t = f;
			for (int j = 0; j < s * K; ++j) {
				if (val * t <= M) {
					tmp.emplace_back(val * t);
					t *= f;
				} else {
					break;
				}
			}
		}
		res = tmp;
		tmp.clear();
	}
	cout << res.size() << endl;

	return 0;
}