B'This is the hard version of this problem. The only difference is the constraint on k -- the number of gifts in the offer. In this version: 2 <= k <= n . Vasya came to the store to buy goods for his friends for the New Year. It turned out that he was very lucky -- today the offer " k of goods for the price of one" is held in store. Using this offer, Vasya can buy exactly k of any goods, paying only for the most expensive of them. Vasya decided to take this opportunity and buy as many goods as possible for his friends with the money he has. More formally, for each good, its price is determined by a_i -- the number of coins it costs. Initially, Vasya has p coins. He wants to buy the maximum number of goods. Vasya can perform one of the following operations as many times as necessary: Please note that each good can be bought no more than once. For example, if the store now has n=5 goods worth a_1=2, a_2=4, a_3=3, a_4=5, a_5=7 , respectively, k=2 , and Vasya has 6 coins, then he can buy 3 goods. A good with the index 1 will be bought by Vasya without using the offer and he will pay 2 coins. Goods with the indices 2 and 3 Vasya will buy using the offer and he will pay 4 coins. It can be proved that Vasya can not buy more goods with six coins. Help Vasya to find out the maximum number of goods he can buy. The first line contains one integer t ( 1 <= t <= 10^4 ) -- the number of test cases in the test. The next lines contain a description of t test cases. The first line of each test case contains three integers n, p, k ( 2 <= n <= 2 cdot 10^5 , 1 <= p <= 2 cdot10^9 , 2 <= k <= n ) -- the number of goods in the store, the number of coins Vasya has and the number of goods that can be bought by the price of the most expensive of them. The second line of each test case contains n integers a_i ( 1 <= a_i <= '...