#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0}, dy[] = {0, 1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struct edge {
  long long to, cost;
};
vector<vector<edge> > G;
long long mod_pow(long long a, long long b) {
  long long res = 1, mul = a;
  for (int i = 0; i < 31; ++i) {
    if (b >> i & 1) {
      res *= mul;
      res %= MOD;
    }
    mul = (mul * mul) % MOD;
  }
  return res;
}
void addedge(int from, int to, int cost) {
  G[from].push_back({to, cost});
  G[to].push_back({from, cost});
}
int a, b, c, ans;
int main() {
  cin >> a >> b >> c;
  for (int i = 1; i <= b; ++i) {
    if (c % i == 0) {
      ++ans;
    }
  }
  cout << ans << endl;
}
