#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll fib[75];
  fib[0] = 1;
  fib[1] = 2;
  for(int i = 2; i < 75; i++) fib[i] = fib[i-1] + fib[i-2];
  ll acc[76];
  acc[0] = 0;
  rep(i, 75) acc[i + 1] = acc[i] + fib[i];
  int tt;
  cin >> tt;
  vector<pair<ll, ll>> dp, ndp;
  while(tt--) {
    int n;
    ll w;
    cin >> n >> w;
    ll c[75];
    rep(i, n) cin >> c[i];
    dp.clear();
    dp.emplace_back(0, 0);
    ll val_max = 0;
    rrep(i, n) {
      ndp = dp;
      for(auto [val, cost]: dp) if (ll nc = cost + c[i]; nc <= w) {
        ll nv = val + fib[i];
        ndp.emplace_back(nv, nc);
        chmax(val_max, nv);
      }
      if (i) {
        ll lb = val_max - acc[i];
        int sz = ndp.size();
        rep(i, sz) if (ndp[i].first <= lb) {
          swap(ndp[i], ndp.back());
          ndp.pop_back();
          i--; sz--;
        }
        sort(all(ndp));
        dp.clear();
        for(auto [val, cost]: ndp) {
          if (!dp.empty() && dp.back().first == val) continue;
          while(!dp.empty() && dp.back().second >= cost) dp.pop_back();
          dp.emplace_back(val, cost);
        }
      }
    }
    cout << val_max << '\n';
  }
}