#include <bits/stdc++.h>
using namespace std;
const int N = 150500;
const int inf = 1e9;
inline int read() {
  char ch;
  while ((ch = getchar()) < '0' || ch > '9')
    ;
  int res = ch - '0';
  while ((ch = getchar()) >= '0' && ch <= '9') res = res * 10 + ch - '0';
  return res;
}
int H, n, len, tag[N << 2], mn[N << 2];
int a[N], b[N];
void pushup(int k) { mn[k] = min(mn[k << 1], mn[k << 1 | 1]) + tag[k]; }
void chg(int k, int v) {
  tag[k] += v;
  mn[k] += v;
}
void modify(int k, int l, int r, int x, int y, int v) {
  if (l >= x && r <= y) return chg(k, v);
  if (l > y || r < x) return;
  int mid = l + r >> 1;
  modify(k << 1, l, mid, x, y, v);
  modify(k << 1 | 1, mid + 1, r, x, y, v);
  pushup(k);
}
int main() {
  n = read();
  len = read();
  H = read();
  for (int i = 1; i <= len; i++) b[i] = read();
  sort(b + 1, b + 1 + len);
  for (int i = 1; i <= n; i++) {
    a[i] = read();
    a[i] = lower_bound(b + 1, b + 1 + len, H - a[i]) - b;
  }
  int ans = 0;
  for (int i = 1; i <= len; i++) modify(1, 1, len, i, len, -1);
  for (int i = 1; i <= len; i++) modify(1, 1, len, a[i], len, 1);
  if (mn[1] >= 0) ans++;
  for (int i = len + 1; i <= n; i++) {
    modify(1, 1, len, a[i - len], len, -1);
    modify(1, 1, len, a[i], len, 1);
    if (mn[1] >= 0) ans++;
  }
  printf("%d", ans);
  return 0;
}
