Stones game

Sam is playing a game. Currently in the game, he is at a field full of stones. There are total N kinds of stones. There is unlimited supply of each kind of stone.

Sam knows that one stone of kind i needs Ai minutes to pick it from the ground and it will give sam a profit of Bi Rs.

Sam has K minutes of free time. During this free time, sam want to pick stones so as to maximize his profit. But he can not pick stones of different kinds, he has to pick stones of a single kind.

Please help Sam to find the maximal possible profit.
        
       Input:-1
3 10
3 4 5
4 4 5
       Input Description: first line contains single integer T denoting The number of test cases.
-first line of each test case contains two integers N and K.
-Next line contains N integers Ai denoting The time needed to pick one stone of kind i.
-Next line contains N integers Bi denoting The profit due to picking ithth stone. 
       Output: 12
       Output Description: For each test case, print a single line containing maximal possible profit. 
       Constraints: 1 <= T <= 5
1 <= N <= 105
0 <= K <= 109
1 <= Ai, Bi <= 109
       Explanation: If Sam picks stones of first kind he can pick 3 stones, he will get a profit of 3*4 = 12 Rs. If Sam picks stones of second kind he can pick 2 stones, he will get a profit of 2*4 = 8 Rs. If Sam picks stones of third kind he can pick 2 stones, he will get a profit of 2*5 = 10 Rs.

So the maximum possible profit is 12.