#include <iostream>
#include <set>
#include <algorithm>
using namespace std;

int main()
{

    int n, m, k;
    cin >> n >> m >> k;

    int aparments[n];
    int applicant[m];

    for(int i = 0; i < n; i++) {
        cin >> aparments[i];
    }

    for(int i = 0; i < m; i++) {
        cin >> applicant[i];
    }

    sort(aparments, aparments + n);
    sort(applicant, applicant + m);


    int i = 0;
    int j = 0;

    int res = 0;
    while(i < n and j < m) {
        if(abs(aparments[i] - applicant[j]) <= k) {
            res++;
            i++;
            j++;
        }
        else if(aparments[i] < applicant[j]) {
            i++;
        }
        else {
            j++;
        }
    }

    cout << res << endl;

    return 0;
}