#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
const int SS = 4 * N;
int mn[SS], add[SS];
int n, m, k, a[N], b[N];
void shift(int v) {
  mn[2 * v] += add[v];
  add[2 * v] += add[v];
  mn[2 * v + 1] += add[v];
  add[2 * v + 1] += add[v];
  add[v] = 0;
}
void update(int l, int r, int val, int s = 0, int e = n, int v = 1) {
  if (r <= s || l >= e) return;
  if (l <= s && e <= r) {
    add[v] += val;
    mn[v] += val;
    return;
  }
  shift(v);
  int mid = (s + e) / 2;
  update(l, r, val, s, mid, 2 * v);
  update(l, r, val, mid, e, 2 * v + 1);
  mn[v] = min(mn[2 * v], mn[2 * v + 1]);
}
int main() {
  scanf("%d %d %d", &m, &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", &b[i]);
  for (int i = 0; i < m; i++) scanf("%d", &a[i]);
  sort(b, b + n);
  for (int i = 0; i < n; i++) update(i, i + 1, -i - 1);
  for (int i = 0; i < m; i++) a[i] = lower_bound(b, b + n, k - a[i]) - b;
  for (int i = 0; i < n - 1; i++) update(a[i], n, 1);
  int ans = 0;
  for (int i = n - 1; i < m; i++) {
    update(a[i], n, 1);
    if (mn[1] >= 0) ans++;
    update(a[i - n + 1], n, -1);
  }
  printf("%d\n", ans);
}
