#include <bits/stdc++.h>
#define N 1000009
#define int long long
using namespace std;
int n, m, a[N];

bool ok(int mid) {
	int tmp = 0;
	for (int i = 1; i <= n; i++) {
		tmp += max( mid - 2 * a[i] - 1, 0ll);
		if (tmp >= m)
			return 1;
	}
	return 0;
}

void solve() {
	scanf("%lld%lld", &n, &m);
	for (int i = 1; i <= n; i++)
		scanf("%lld", &a[i]);
	int l = 0, r = 1000000000000000000, ans = 0;
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (ok(mid))
			ans = mid, r = mid - 1;
		else
			l = mid + 1;
	}
	printf("%lld\n", ans);
}

signed main() {
	int t;
	scanf("%lld", &t);
	while (t--)
		solve();
	return 0;
}