#include <bits/stdc++.h>
using namespace std;
int Read() {
  char c;
  while (c = getchar(), (c != '-') && (c < '0' || c > '9'))
    ;
  bool neg = (c == '-');
  int ret = (neg ? 0 : c - 48);
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + c - 48;
  return neg ? -ret : ret;
}
const int MAXN = 150005;
struct node {
  int d, m;
} t[1 << 19];
int N, M, H, ans, a[MAXN], b[MAXN];
void init() {
  scanf("%d%d%d", &N, &M, &H);
  for (int i = 1; i <= M; i++) b[i] = H - Read();
  sort(b + 1, b + M + 1);
  for (int i = 1; i <= N; i++)
    a[i] = Read(), a[i] = upper_bound(b + 1, b + M + 1, a[i]) - b - 1;
}
void Apply(int x, int v) { t[x].d += v, t[x].m += v; }
void Mod(int id, int l, int r, int x, int v) {
  if (!x) return;
  if (x >= r) {
    Apply(id, v);
    return;
  }
  if (t[id].d)
    Apply(id + id, t[id].d), Apply(id + id + 1, t[id].d), t[id].d = 0;
  int mid = (l + r) >> 1;
  Mod(id + id, l, mid, x, v);
  if (x > mid) Mod(id + id + 1, mid + 1, r, x, v);
  t[id].m = min(t[id + id].m, t[id + id + 1].m);
}
void work() {
  for (int i = 1; i <= M; i++) Mod(1, 1, M, i, -1), Mod(1, 1, M, a[i], 1);
  ans = (t[1].m == 0);
  for (int i = M + 1; i <= N; i++)
    Mod(1, 1, M, a[i - M], -1), Mod(1, 1, M, a[i], 1), ans += (t[1].m == 0);
  printf("%d\n", ans);
}
int main() {
  init();
  work();
  return 0;
}
