B"You are an environmental activist at heart but the reality is harsh and you are just a cashier in a cinema. But you can still do something! You have n tickets to sell. The price of the i -th ticket is p_i . As a teller, you have a possibility to select the order in which the tickets will be sold (i.e. a permutation of the tickets). You know that the cinema participates in two ecological restoration programs applying them to the order you chose: If the ticket is in both programs then the (x + y) % are used for environmental activities. Also, it's known that all prices are multiples of 100 , so there is no need in any rounding. For example, if you'd like to sell tickets with prices [400, 100, 300, 200] and the cinema pays 10 % of each 2 -nd sold ticket and 20 % of each 3 -rd sold ticket, then arranging them in order [100, 200, 300, 400] will lead to contribution equal to 100 cdot 0 + 200 cdot 0.1 + 300 cdot 0.2 + 400 cdot 0.1 = 120 . But arranging them in order [100, 300, 400, 200] will lead to 100 cdot 0 + 300 cdot 0.1 + 400 cdot 0.2 + 200 cdot 0.1 = 130 . Nature can't wait, so you decided to change the order of tickets in such a way, so that the total contribution to programs will reach at least k in minimum number of sold tickets. Or say that it's impossible to do so. In other words, find the minimum number of tickets which are needed to be sold in order to earn at least k . The first line contains a single integer q ( 1 <= q <= 100 ) -- the number of independent queries. Each query consists of 5 lines. The first line of each query contains a single integer n ( 1 <= n <= 2 cdot 10^5 ) -- the number of tickets. The second line contains n integers p_1, p_2, ... , p_n ( 100 <= p_i <= 10^9 , p_i bmod 100 = 0 ) -- the corresponding prices of tickets. The third line contains two integers x and a$"...