#include <bits/stdc++.h>
using namespace std;
const long long linf = 1e18 + 5;
const int mod = (int)1e9 + 7;
const int logN = 17;
const int inf = 1e9;
const int N = 4e6 + 5;
int l, r, p, s, n, m, x, y, z, a[N], b, c, dp[2][N], T[105], D[N];
bool isprime(int x) {
  if (x < 2) return 0;
  if (x < 3) return 1;
  for (int i = 2; i * i <= x; i++)
    if (x % i == 0) return 0;
  return 1;
}
void dfs(int w, long long x) {
  if (x > r || w >= 100) return;
  if (T[w] && w * x <= r) {
    a[++s] = w * x;
    dfs(w, w * x);
  }
  dfs(w + 1, x);
}
int main() {
  scanf("%d %d %d", &l, &r, &p);
  for (int i = 1; i <= 100; i++) T[i] = isprime(i);
  a[++s] = 1;
  dfs(1, 1);
  sort(a + 1, a + s + 1);
  for (int i = 1; i <= s; i++) D[i] = dp[0][i] = a[i] + 1;
  memset(dp, 10, sizeof dp);
  dp[1][1] = 1;
  dp[0][1] = 0;
  for (int i = 2; i <= p; i++) {
    int at, tt = 1, t = i & 1, ttt = !t;
    for (int j = 1; j <= s; j++) {
      dp[t][j] = dp[ttt][j] + 1;
      if (a[j] % i == 0) {
        at = a[j] / i;
        while (a[tt] < at) tt++;
        if (dp[t][tt] + 1 < dp[t][j]) dp[t][j] = dp[t][tt] + 1;
      }
      if (D[j] > dp[t][j]) D[j] = dp[t][j];
    }
  }
  int ans = 0;
  for (int i = 1; i <= s; i++)
    if (l <= a[i] && a[i] <= r && D[i] <= p) {
      ans++;
    }
  cout << ans << '\n';
  return 0;
}
