#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 5;
int n, a[N], m;
void solve() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    sort(a + 1, a + n + 1);
    int j = 1, sum = a[1];
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        while(j < n && sum + a[j+1] <= m && a[j+1] - a[i] <= 1) 
            sum += a[++j];
        ans = max(ans, sum);
        sum -= a[i];
    }
    cout << ans << endl;
}

signed main() {
    int t; cin >> t;
    while(t--)
        solve();
    return 0;
}