#include <bits/stdc++.h>
using namespace std;
int l, r, p;
vector<int> v, dp, can;
int main() {
  cin >> l >> r >> p;
  v.push_back(1);
  for (long long int i = 2; i <= p; i++) {
    int ok = 1;
    for (long long int j = 2; j <= i - 1; j++) ok &= (i % j != 0);
    if (ok)
      for (int j = 0; j < v.size(); j++)
        if (v[j] * i <= r) v.push_back(v[j] * i);
  }
  sort(v.begin(), v.end());
  dp.resize(v.size(), 1000000007LL);
  dp[0] = 0;
  can.resize(v.size());
  for (int P = 2; P <= p; P++) {
    int div = 0;
    for (int j = 0; j < v.size(); j++)
      if (v[j] % P == 0) {
        if (dp[j] > dp[div] + 1) {
          dp[j] = dp[div] + 1;
          if (dp[j] + P <= p) can[j] = 1;
        }
        div++;
      }
  }
  int res = 0;
  for (int j = 0; j < v.size(); j++)
    if (can[j] and v[j] >= l) res++;
  cout << res << endl;
}
