#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const long long mod = 1e9 + 7;
const long long inf = 1e18 + 10;
int a[N], b[N], mn[4 * N], lz[4 * N], n;
void build(int l = 0, int r = n, int id = 1) {
  if (r - l == 1) {
    mn[id] = -l;
    return;
  }
  int mid = (l + r) / 2;
  build(l, mid, 2 * id);
  build(mid, r, 2 * id + 1);
  mn[id] = min(mn[2 * id], mn[2 * id + 1]);
}
void shift(int id) {
  int x = lz[id];
  mn[2 * id] += x;
  mn[2 * id + 1] += x;
  lz[2 * id] += x;
  lz[2 * id + 1] += x;
  lz[id] = 0;
}
void upd(int l, int r, int x, int s = 0, int e = n, int id = 1) {
  if (e <= l || r <= s) return;
  if (l <= s && e <= r) {
    mn[id] += x;
    lz[id] += x;
    return;
  }
  shift(id);
  int mid = (s + e) / 2;
  upd(l, r, x, s, mid, 2 * id);
  upd(l, r, x, mid, e, 2 * id + 1);
  mn[id] = min(mn[2 * id], mn[2 * id + 1]);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int m, h;
  cin >> m >> n >> h;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  b[0] = n;
  for (int i = 1; i <= m; i++) {
    int x;
    cin >> x;
    b[i] = lower_bound(a, a + n, h - x) - a;
  }
  int ans = 0;
  build();
  for (int i = 1; i < n; i++) upd(b[i], n, 1);
  for (int i = n; i <= m; i++) {
    upd(b[i - n], n, -1);
    upd(b[i], n, 1);
    if (1 <= mn[1]) ans++;
  }
  cout << ans;
  return 0;
}
