시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 512 MB0000.000%

## 문제

As more and more highways are cutting trough the wild forests and habitats of snakes, jungles have really become “a jungle out there”.

Now, thanks to their capacity of sensing vibrations on the ground, the snake family knows the exact position, at time t = 0, of each car that will pass on the road today; and based on this, they can decide when they want to cross.

Your goal is to determine how many members of the family are able to make it to the other side of the road without being killed.

## 입력

The input file consists of multiple test cases. The first line of the input file consists of a single integer indicating the number of test cases. Each test case follows. The first line of a test case consists of six integers s, c, w, u, t1, and t2, each separated by a single space:

• 1 ≤ s ≤ 100 000 is the number of snakes;
• 1 ≤ c ≤ 100 000 is the number of cars;
• 1 ≤ w ≤ 100 000 is the width of the road (in meters);
• 1 ≤ u ≤ 100 000 is the speed of the snakes (in meters per second);
• 0 ≤ t1 ≤ 1 000 000 000 is the earliest possible departure time of a snake (in seconds);
• 0 ≤ t2 ≤ 1 000 000 000 is the latest possible arrival time of a snake (in seconds), with t1 < t2.

The next s lines of the test case each consist of a single integer 1 ≤ li ≤ 1 000 000 000 for 1 ≤ i ≤ s indicating the length (in meters) of the i-th snake: note that multiple snakes may have the same length. Last, the next c lines of the test case each consist of a single integer 0 ≤ xj ≤ 1 000 000 000 for 1 ≤ j ≤ c indicating the distance at time t = 0 (in meters) between the initial position of the car and the crossing path of the snakes: all cars start at the East of that crossing path, and you may assume that each car has a different starting position.

## 출력

For each test case in the input, your program should produce one line consisting of one integer that indicates how many of the snakes can make it to the other side. There should be no blank lines in your output.

## 예제 입력 1

2
2 5 4 2 3 9
1
5
3
4
8
16
9
4 2 10 5 2 5
2
5
8
10
8
3


## 예제 출력 1

1
0


## 힌트

The first test case of the sample input is illustrated in Figure 1, with cars being numbered according to their order in the input. The snake with length 1 can cross between cars 2 and 3, but the snake with length 5 has no opportunity between t1 and t2 to cross safely.

Figure 1: Roads and cars in the first test case of the sample input