#include <bits/stdc++.h>
using namespace std;
const int inf = 0x20202020;
const int mod = 1000000007;
template <class T>
inline void read(T& x) {
  bool fu = 0;
  char c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') fu = 1, c = getchar();
  for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
  if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
  read(x);
  read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
  read(x);
  read(y);
  read(z);
}
template <class T>
inline void read(T& x, T& y, T& z, T& q) {
  read(x);
  read(y);
  read(z);
  read(q);
}
const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1};
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 3333333, M = 111111;
int l, m, n, t, C, tot, r, p;
int a[N], Min[N], can[N];
int main() {
  scanf("%d%d%d", &l, &r, &p);
  a[tot = 1] = 1;
  for (int q = (2); q <= (p); ++q) {
    int bo = 0;
    for (int i = (2); i <= (q - 1); ++i)
      if (q % i == 0) bo = 1;
    if (bo) continue;
    for (int i = (1); i <= (tot); ++i)
      if (1ll * a[i] * q <= r) a[++tot] = a[i] * q;
  }
  sort(a + 1, a + 1 + tot);
  for (int i = (2); i <= (tot); ++i) Min[i] = inf;
  for (int q = (2); q <= (p); ++q) {
    int pt = 1;
    for (int i = (1); i <= (tot); ++i)
      if (a[i] % q == 0) {
        while (a[pt] != a[i] / q) ++pt;
        if (Min[pt] + 1 < Min[i]) {
          Min[i] = Min[pt] + 1;
          if (q + Min[i] <= p) can[i] = 1;
        }
      }
  }
  int cnt = 0;
  for (int i = (1); i <= (tot); ++i)
    if (can[i] && a[i] >= l && a[i] <= r) ++cnt;
  printf("%d\n", cnt);
  return 0;
}
