## Algorithm

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Did you know you can download more RAM? There is a shop with n different pieces of software that increase your RAM. The i-th RAM increasing software takes ai�� GB of memory to run (temporarily, once the program is done running, you get the RAM back), and gives you an additional bi�� GB of RAM (permanently). Each software can only be used once. Your PC currently has k GB of RAM.

Note that you can't use a RAM-increasing software if it takes more GB of RAM to use than what you currently have.

Since RAM is the most important thing in the world, you wonder, what is the maximum possible amount of RAM achievable?

Input

The first line of the input contains a single integer t (1t1001≤�≤100) — the number of test cases. The description of test cases follows.

The first line of each test case contains the integers n and k (1n1001≤�≤1001k10001≤�≤1000). Then two lines follow, each containing n integers describing the arrays a and b (1ai,bi10001≤��,��≤1000).

Output

For each test case, output a single line containing the largest amount of RAM you can achieve.

Example
input
Copy
4
3 10
20 30 10
9 100 10
5 1
1 1 5 1 1
1 1 1 1 1
5 1
2 2 2 2 2
100 100 100 100 100
5 8
128 64 32 16 8
128 64 32 16 8
output
Copy
29
6
1
256

Note

In the first test case, you only have enough RAM to run the third software initially, but that increases your RAM to 2020 GB, which allows you to use the first software, increasing your RAM to 2929 GB. The only software left needs 3030 GB of RAM, so you have to stop here.

In the second test case, you can use the first, second, fourth and fifth software that need only 11 GB of RAM per software to run to increase your RAM to 55 GB, and then use the last remaining one to increase your RAM to 66 GB.

In the third test case, all the software need more than 11 GB of RAM to run, so the amount of RAM you have stays at 11 GB.

## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);

int t;
cin>>t;
while(t--){
int n, k;
cin>>n>>k;
vector<pair<int, int>> vect(n);
for(int i = 0; i < n; i++){
cin>>vect[i].first;
}
for(int i = 0; i < n; i++){
cin>>vect[i].second;
}
sort(vect.begin(), vect.end());
for(int i = 0; i < n; i++){
if(vect[i].first > k){
break;
}
k += vect[i].second;
}
cout<<k<<endl;
}

}
Copy The Code &

Input

cmd
4
3 10
20 30 10
9 100 10
5 1
1 1 5 1 1
1 1 1 1 1
5 1
2 2 2 2 2
100 100 100 100 100
5 8
128 64 32 16 8
128 64 32 16 8

Output

cmd
29
6
1
256