Youβve decided to implement the simplest version of a dating app. For that, youβve decided to collect the heights of individuals in Group A as and the heights of individuals in Group B as Youβve decided to match as many pairs as possible (one person can only be matched once). And you think that couples will be okay if:
The person from Group B is not shorter than the person from Group A by x and
The person from Group B is not taller than the person from Group A by more than y.
Youβd like to match as many pairs as possible.
Input
The first line of the input contains 4 integers n, m (1 β€ n, m β€ ), x, and y (0 β€ x, y β€ ) - the number of individuals in Group A, the number of individuals in Group B, and the bounds for acceptable heights.
The next line contains n integers representing the heights of the individuals in Group A (1 β€ β€ ).
The line after that contains m integers representing the heights of the individuals in Group B (1 β€ β€ ).
Output
The program should print the maximum number of pairs matched.