from sys import stdin
input = stdin.readline
for _ in range(int(input())):
n, H = map(int, input().split())
a = sorted([int(x) for x in input().split()])
if H % (a[-1] + a[-2]) == 0:
print(H // (a[-1] + a[-2]) * 2)
elif H % (a[-1] + a[-2]) <= a[-1]:
print(H // (a[-1] + a[-2]) * 2 + 1)
else:
print(H // (a[-1] + a[-2]) * 2 + 2)#include <bits/stdc++.h>
using namespace std;
void LeS_Go() {
long long n, H; cin >> n >> H;
vector<long long> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr.rbegin(), arr.rend());
long long x = arr[0], y = arr[1];
if (H % (x + y) == 0) {
cout << 2 * (H / (x + y)) << '\n';
} else if (H % (x + y) <= x) {
cout << 2 * (H / (x + y)) + 1 << '\n';
} else {
cout << 2 * (H / (x + y)) + 2 << '\n';
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t; cin >> t;
int caase = 1;
while (t--) {
// cout << "Case " << caase++ << ": ";
LeS_Go();
}
return 0;
}628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |