#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
vector<long long> divisor(long long val) {
  vector<long long> res;
  for (long long i = 1; i * i <= val; ++i) {
    if (val % i == 0) {
      res.emplace_back(i);
      if (i * i != val) res.emplace_back(val / i);
    }
  }
  sort(ALL(res));
  return res;
}

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n, k, m; cin >> n >> k >> m;
  vector<long long> yakusu = divisor(n);
  set<long long> st, nx;
  for (long long ll : yakusu) {
    if (ll > m) break;
    st.emplace(ll);
  }
  long long i;
  for (i = 2; i <= k; i <<= 1) {
    vector<long long> memo;
    for (long long ll : st) memo.emplace_back(ll);
    for (long long ll : st) {
      for (long long ya : memo) {
        if (ll * ya > m) break;
        if (st.count(ll * ya) == 0) nx.emplace(ll * ya);
      }
    }
    for (long long ll : nx) st.emplace(ll);
    nx.clear();
  }
  if (i != k * 2) {
    i >>= 1;
    for (long long ll : st) {
      for (long long ya : yakusu) {
        if (ll * ya > m) break;
        if (st.count(ll * ya) == 0) nx.emplace(ll * ya);
      }
    }
    for (long long ll : nx) st.emplace(ll);
    nx.clear();
  }
  cout << st.size() << '\n';
  return 0;
}