#include <bits/stdc++.h>
const int N = 150000 + 9;
int a[N], min[N * 4], tag[N * 4], b[N], n, len, h, L, R, D;
inline void push_up(const int idx) {
  min[idx] = std::min(min[idx * 2], min[idx * 2 + 1]);
}
inline void push_down(const int idx) {
  if (!tag[idx]) return;
  tag[idx * 2] += tag[idx];
  tag[idx * 2 + 1] += tag[idx];
  min[idx * 2] += tag[idx];
  min[idx * 2 + 1] += tag[idx];
  tag[idx] = 0;
}
void modify(const int idx, const int l, const int r) {
  if (L <= l && r <= R) return (void)(min[idx] += D, tag[idx] += D);
  const int mid = (l + r) / 2;
  if (tag[idx]) push_down(idx);
  if (L <= mid) modify(idx * 2, l, mid);
  if (mid < R) modify(idx * 2 + 1, mid + 1, r);
  push_up(idx);
}
int main() {
  scanf("%d%d%d", &n, &len, &h);
  for (int i = 1; i <= len; ++i) {
    scanf("%d", b + i);
    L = R = i;
    D = len - i + 1;
    modify(1, 1, len);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
    a[i] = h - a[i];
  }
  std::sort(b + 1, b + 1 + len);
  int cnt = 0, ans = 0;
  for (int i = 1; i <= len; ++i) {
    if (a[i] > b[len]) {
      ++cnt;
      continue;
    }
    if (i != 1 && a[i] <= 0) continue;
    L = 1;
    R = std::lower_bound(b + 1, b + 1 + len, a[i]) - b;
    D = -1;
    modify(1, 1, len);
  }
  if (!cnt && min[1] >= 0) ++ans;
  for (int i = len + 1; i <= n; ++i) {
    if (a[i - len] <= b[len]) {
      L = 1;
      R = std::lower_bound(b + 1, b + 1 + len, a[i - len]) - b;
      D = 1;
      modify(1, 1, len);
    } else
      --cnt;
    if (a[i - len + 1] <= 0) {
      L = 1;
      R = std::lower_bound(b + 1, b + 1 + len, a[i - len + 1]) - b;
      D = -1;
      modify(1, 1, len);
    }
    if (a[i] > b[len]) {
      ++cnt;
      continue;
    }
    if (a[i] > 0) {
      L = 1;
      R = std::lower_bound(b + 1, b + 1 + len, a[i]) - b;
      D = -1;
      modify(1, 1, len);
    }
    if (!cnt && min[1] >= 0) ++ans;
  }
  printf("%d\n", ans);
}
