Toi11_cannon

#include<stdio.h>
#include<algorithm>
using namespace std;

int main()
{
    int n,m,k,l;
    scanf("%d %d %d %d",&n,&m,&k,&l);
    int cannon[n];
    for(int i = 0 ; i < n ; i++){
        scanf("%d",&cannon[i]);
    }
    sort(cannon,cannon+n);
    for(int T = 0 ; T < k ; T ++){
        int supply[m];
        for(int i = 0 ; i < m ; i++){
            scanf("%d",&supply[i]);
        }
        sort(supply,supply+m);
        int I = 0, J = 0;
        int ans = 0;
        while(J < m){
            while(I < n && cannon[I] < supply[J] - l)I++; //skipping cannon
            while(I < n && supply[J] - l <= cannon[I] && cannon[I] <= supply[J] + l){ //counting cannon
                I++;
                ans++;
            }
            J++;
        }
        printf("%d\n",ans);
    }
    return 0;
}