#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n,m,k;
cin >> n >> m >> k;
int a[n],b[m];
for (int i=0;i<n;i++) {
cin >> a[i];
}
for (int i=0;i<m;i++) {
cin >> b[i];
}
sort(a,a+n);
sort(b,b+m);
int i=0,j=0,d=0;
while (i<n && j<m) {
if (b[j]<a[i]-k) {
j++;
} else if (b[j]>a[i]+k) {
i++;
} else {
d++;
i++;
j++;
}
}
cout << d;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgbixtLGs7CgljaW4gPj4gbiA+PiBtID4+IGs7CglpbnQgYVtuXSxiW21dOwoJZm9yIChpbnQgaT0wO2k8bjtpKyspIHsKCQljaW4gPj4gYVtpXTsKCX0KCWZvciAoaW50IGk9MDtpPG07aSsrKSB7CgkJY2luID4+IGJbaV07Cgl9Cglzb3J0KGEsYStuKTsKCXNvcnQoYixiK20pOwoJaW50IGk9MCxqPTAsZD0wOwoJd2hpbGUgKGk8biAmJiBqPG0pIHsKCQlpZiAoYltqXTxhW2ldLWspIHsKCQkJaisrOwoJCX0gZWxzZSBpZiAoYltqXT5hW2ldK2spIHsKCQkJaSsrOwoJCX0gZWxzZSB7CgkJCWQrKzsKCQkJaSsrOwoJCQlqKys7CgkJfQoJfQoJY291dCA8PCBkOwp9