#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
vector<int> pier, a;
void gen(int akt, int nr) {
  if (nr == pier.size()) {
    a.push_back(akt);
    return;
  }
  long long ilo = 1;
  while (ilo * akt <= 1000000000) {
    gen(akt * ilo, nr + 1);
    ilo *= pier[nr];
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  int l, r, p;
  cin >> l >> r >> p;
  for (int i = 2; i <= p; ++i) {
    bool ok = true;
    for (int j = 2; j < i; ++j)
      if (i % j == 0) ok = false;
    if (ok) pier.push_back(i);
  }
  gen(1, 0);
  sort(a.begin(), a.end());
  vector<int> najm(a.size(), INF);
  vector<int> dp(a.size(), INF);
  dp[0] = 0;
  for (int i = 2; i <= p; ++i) {
    int gdzie = 0;
    for (int j = 1; j < a.size(); ++j) {
      while (a[gdzie] * i < a[j]) ++gdzie;
      if (a[gdzie] * i == a[j]) dp[j] = min(dp[j], dp[gdzie] + 1);
    }
    for (int j = 0; j < a.size(); ++j) najm[j] = min(najm[j], dp[j] + i);
  }
  int odp = 0;
  for (int i = 0; i < a.size(); ++i)
    if (a[i] >= l && a[i] <= r && najm[i] <= p) ++odp;
  cout << odp;
  return 0;
}
