#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int INF = 1e9;
const ll LINF = 1e18;
const int N = 2e5 + 5;
int n, m, k;
int a[N], b[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) cin >> b[i];
sort(a + 1, a + n + 1);
sort(b + 1, b + m + 1);
int ans = 0;
for (int i = 1, j = 1; i <= n; i++) {
// j là vị trí nhỏ nhất thoả mãn b[j] >= a[i] - k
while (j <= m && b[j] < a[i] - k) j++;
if (j <= m && b[j] <= a[i] + k) {
ans++;
j++;
}
}
cout << ans << '\n';
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+IAoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsgIAoKdHlwZWRlZiBsb25nIGxvbmcgbGw7ICAKdHlwZWRlZiBwYWlyPGludCwgaW50PiBpaTsgIAoKY29uc3QgaW50IElORiA9IDFlOTsgIApjb25zdCBsbCBMSU5GID0gMWUxODsgIAoKY29uc3QgaW50IE4gPSAyZTUgKyA1OyAKCmludCBuLCBtLCBrOyAKaW50IGFbTl0sIGJbTl07IAoKaW50IG1haW4oKSB7Cglpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7IAoJY2luLnRpZShudWxscHRyKTsgCQoJY2luID4+IG4gPj4gbSA+PiBrOyAgCglmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspIGNpbiA+PiBhW2ldOyAKCWZvciAoaW50IGkgPSAxOyBpIDw9IG07IGkrKykgY2luID4+IGJbaV07ICAKCglzb3J0KGEgKyAxLCBhICsgbiArIDEpOyAKCXNvcnQoYiArIDEsIGIgKyBtICsgMSk7IAoKCWludCBhbnMgPSAwOyAgCglmb3IgKGludCBpID0gMSwgaiA9IDE7IGkgPD0gbjsgaSsrKSB7CgkJLy8gaiBsw6AgduG7iyB0csOtIG5o4buPIG5o4bqldCB0aG/huqMgbcOjbiBiW2pdID49IGFbaV0gLSBrIAoJCXdoaWxlIChqIDw9IG0gJiYgYltqXSA8IGFbaV0gLSBrKSBqKys7ICAgCgkJaWYgKGogPD0gbSAmJiBiW2pdIDw9IGFbaV0gKyBrKSB7CgkJCWFucysrOyAKCQkJaisrOyAKCQl9Cgl9CgoJY291dCA8PCBhbnMgPDwgJ1xuJzsgCn0=