#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long LLINF = 9223372036854775807LL;
int l, r, p;
bool isprime(int x) {
  for (int i = 2; i * i <= x; ++i)
    if (x % i == 0) return false;
  return true;
}
const int maxn = 3000010;
int a[maxn];
int acnt = 0;
bool prime[110];
void gen(long long val, int lst) {
  if (lst < p) gen(val, lst + 1);
  if (prime[lst] && val * lst <= r) {
    a[acnt++] = val * lst;
    gen(val * lst, lst);
  }
}
int dp[maxn];
bool can[maxn];
int cinf = 110;
int main() {
  for (int i = 0; i < 110; ++i) prime[i] = isprime(i);
  scanf("%d%d%d", &l, &r, &p);
  a[acnt++] = 1;
  gen(1, 2);
  sort(a, a + acnt);
  for (int i = 0; i < acnt; ++i) dp[i] = cinf;
  dp[0] = 0;
  for (int j = 0; j < p; ++j) {
    int ptr = 0;
    for (int i = 0; i < acnt; ++i) {
      if (dp[i] > p) continue;
      can[i] |= dp[i] <= p;
      if (a[i] * (long long)j <= r) {
        int needval = a[i] * j;
        while (a[ptr] != needval) ++ptr;
        int wh = ptr;
        dp[wh] = min(dp[wh], dp[i] + 1);
      }
      ++dp[i];
    }
  }
  int ans = 0;
  for (int i = 0; i < acnt; ++i)
    if (a[i] >= l) ans += can[i];
  printf("%d\n", ans);
  return 0;
}
