#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = (int) 2e4 + 7;
int n, a[N];
ll suf[N], c, sol = 0;

void solve(int pos, ll sum = 0) {
  if (sum > c || sol == c) return;
  sol = max(sol, sum);
  if (pos == n + 1) return;
  if (sum + suf[pos] <= sol) return;
  solve(pos + 1, sum + a[pos]);
  if (sum + suf[pos + 1] > sol) solve(pos + 1, sum);
}

signed main() {
#ifdef ONPC
  freopen("input.txt", "r", stdin);
#else
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif // ONPC

  int tt;
  cin >> tt;
  while (tt--) {
    cin >> n >> c;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    reverse(a + 1, a + n + 1);
    suf[n + 1] = 0;
    for (int i = n; i >= 1; i--) {
      suf[i] = suf[i + 1] + a[i];
    }
    sol = 0;
    solve(1);
    cout << sol << "\n";
  }
  return 0;
}