#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
const int maxt = 3e6 + 5;
bool p[maxn], vst[maxt];
int cnt, tot, l, r, n, ans;
int prime[maxn], a[maxt], f[maxt];
void read() { cin >> l >> r >> n; }
void dfs(int k, long long num) {
  if (num > r) return;
  if (k > cnt) {
    a[++tot] = num;
    return;
  }
  while (num <= r) {
    dfs(k + 1, num);
    num *= prime[k];
  }
}
void work() {
  for (int i = 2; i <= n; i++) {
    if (!p[i]) prime[++cnt] = i;
    for (int j = 1; j <= cnt && i * prime[j] <= n; j++) {
      p[i * prime[j]] = 1;
      if (i % prime[j] == 0) break;
    }
  }
  dfs(1, 1);
  sort(a + 1, a + 1 + tot);
  memset(f, 127, sizeof(f));
  f[1] = 0;
  for (int i = 2; i <= n; i++) {
    int pos = 1;
    for (int j = 1; j <= tot; j++)
      if (a[j] % i == 0) {
        while (a[pos] < a[j] / i && pos < tot) pos++;
        f[j] = ((f[j]) < (f[pos] + 1) ? (f[j]) : (f[pos] + 1));
        if (!vst[j] && i + f[j] <= n && a[j] >= l) ans++, vst[j] = 1;
      }
  }
  printf("%d", ans);
}
int main() {
  read();
  work();
  return 0;
}
