#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int N = 4e6 + 5;
const int M = 100 + 5;
int prime[M], is[M], c[N], f[N], vis[N];
int L, R, p, tot, cnt, ans;
inline void pre() {
  for (int i = 2; i <= p; ++i) {
    if (!is[i]) prime[++tot] = i;
    for (int j = 1; j <= tot && prime[j] * i <= p; ++j) {
      is[i * prime[j]] = 1;
      if (i % prime[j] == 0) break;
    }
  }
}
void dfs(int x, int g) {
  c[++cnt] = x;
  for (int i = g; i <= tot; ++i)
    if ((long long)x * prime[i] <= R) dfs(x * prime[i], i);
}
int main() {
  scanf("%d%d%d", &L, &R, &p);
  pre();
  c[cnt = 1] = 1;
  for (int i = 1; i <= tot; ++i) dfs(prime[i], i);
  sort(c + 1, c + cnt + 1);
  memset(f, 0x3f, sizeof(f));
  f[1] = 0;
  for (int i = 2; i <= p; ++i) {
    int l = 1;
    for (int j = 1; j <= cnt; ++j) {
      while (l <= cnt && c[l] != c[j] * i) ++l;
      if (l > cnt) break;
      f[l] = min(f[j] + 1, f[l]);
      if (c[l] >= L && i + f[l] <= p && !vis[l]) ++ans, vis[l] = 1;
    }
  }
  printf("%d\n", ans);
  return 0;
}
