#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 100 * 100;
int mn[4 * MAXN + 10];
int marked[4 * MAXN + 10];
void update(int node, int b, int e, int p, int q, int val) {
  if (marked[node] != 0) {
    marked[2 * node] += marked[node];
    marked[2 * node + 1] += marked[node];
    mn[2 * node] += marked[node];
    mn[2 * node + 1] += marked[node];
    marked[node] = 0;
  }
  if (p <= b && q >= e) {
    marked[node] += val;
    mn[node] += val;
    return;
  }
  if (p > e || q < b) return;
  update(2 * node, b, (b + e) / 2, p, q, val);
  update(2 * node + 1, (b + e) / 2 + 1, e, p, q, val);
  mn[node] = min(mn[2 * node], mn[2 * node + 1]);
}
int query(int node, int b, int e, int p) {
  if (marked[node] != 0) {
    marked[2 * node] += marked[node];
    marked[2 * node + 1] += marked[node];
    mn[2 * node] += marked[node];
    mn[2 * node + 1] += marked[node];
    marked[node] = 0;
  }
  if (b == e) return mn[node];
  if (p <= (b + e) / 2)
    return query(2 * node, b, (b + e) / 2, p);
  else
    return query(2 * node + 1, (b + e) / 2 + 1, e, p);
}
int n, len, h;
vector<int> A;
int a[MAXN + 10];
int main() {
  cin >> n >> len >> h;
  for (int i = 1; i <= len; i++) {
    int q;
    cin >> q;
    A.push_back(q);
  }
  sort(A.begin(), A.end());
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= len; i++) update(1, 1, MAXN, i, i, len - i + 1);
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (i > len) {
      int pos = lower_bound(A.begin(), A.end(), h - a[i - len]) - A.begin() + 1;
      update(1, 1, MAXN, 1, pos, 1);
    }
    int pos = lower_bound(A.begin(), A.end(), h - a[i]) - A.begin() + 1;
    update(1, 1, MAXN, 1, pos, -1);
    if (i >= len && mn[1] == 0) ans++;
  }
  cout << ans << endl;
  return 0;
}
