#include /* #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2") */ #define rep(i, n) for (ll i = 0; i < (int)(n); i++) #define rrep(i, n) for (ll i = (int)(n) - 1; i >= 0; i--) #define all(x) (x).begin(), (x).end() #define sz(x) ll(x.size()) #define yn(joken) cout<<((joken) ? "Yes" : "No")<<"\n" #define YN(joken) cout<<((joken) ? "YES" : "NO")<<"\n" #define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()) using namespace std; using ll = long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vpi = vector>; using vpl = vector>; using vs = vector; using vc = vector; using vd = vector; using vld = vector; using vvi = vector>; using vvl = vector>; using vvs = vector>; using vvc = vector>; using vvd = vector>; using vvld = vector>; using vvvi = vector>>; using vvvl = vector>>; using vvvvi = vector>>>; using vvvvl = vector>>>; template using priq = priority_queue; template using priqg = priority_queue, greater>; const int INF = 1e9; const ll LINF = 2e18; template inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } vi iota(int n) { vi a(n); return iota(a.begin(), a.end(), 0), a; } template vi iota(const vector &a, bool greater = false) { vi ret(a.size()); iota(ret.begin(), ret.end(), 0); sort(ret.begin(), ret.end(), [&](int i, int j) { if(greater) return a[i] > a[j]; return a[i] < a[j]; }); return ret; } template void rearrange(const vector &id) {} template void rearrange_exec(const vector &id, vector &v) { vector w(v.size()); rep(i, sz(id)) w[i] = v[id[i]]; v.swap(w); } // 並び替える順番, 並び替えるvector template void rearrange(const vector &id, Head &a, Tail &...tail) { rearrange_exec(id, a); rearrange(id, tail...); } template vector RUI(const vector &v) { vector res(v.size() + 1); for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i]; return res; } // 反時計周りに 90 度回転 template void roth(vector> &v) { if(empty(v)) return; int n = v.size(), m = v[0].size(); vector> res(m, vector(n)); rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j]; v.swap(res); } // 時計周りに 90 度回転 template void rott(vector> &v) { if(empty(v)) return; int n = v.size(), m = v[0].size(); vector> res(m, vector(n)); rep(i, n) rep(j, m) res[j][n - 1 - i] = v[i][j]; v.swap(res); } bool ispow2(int i) { return i && (i & -i) == i; } bool ispow2(ll i) { return i && (i & -i) == i; } template T ceil(T x, S y) { // x/y以上の最小の整数を返す assert(y); return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y)); } template T floor(T x, S y) { // x/y以下の最大の整数を返す assert(y); return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1))); } template vector> RunLength(const vector &v) { vector> res; for(auto &e : v) { if(res.empty() || res.back().first != e) res.emplace_back(e, 1); else res.back().second++; } return res; } vector> RunLength(const string &v) { vector> res; for(auto &e : v) { if(res.empty() || res.back().first != e) res.emplace_back(e, 1); else res.back().second++; } return res; } template T bin_search(T ok, T ng, const F &f) { while(abs(ok - ng) > 1) { T mid = ok + ng >> 1; (f(mid) ? ok : ng) = mid; } return ok; } template T bin_search_double(T ok, T ng, const F &f, int iter = 80) { while(iter--) { T mid = (ok + ng) / 2; (f(mid) ? ok : ng) = mid; } return ok; } template istream& operator>>(istream& is, vector& v) { for (int i = 0; i < int(v.size()); i++) { is >> v[i]; } return is; } namespace aux { template struct tp { static void output(std::ostream &os, const T &v) { os << std::get(v) << (&os == &cerr ? ", " : " "); tp::output(os, v); } }; template struct tp { static void output(std::ostream &os, const T &v) { os << std::get(v); } }; } // namespace aux template std::ostream &operator<<(std::ostream &os, const std::tuple &t) { if(&os == &cerr) { os << '('; } aux::tp, 0, sizeof...(Ts) - 1>::output(os, t); if(&os == &cerr) { os << ')'; } return os; } template std::ostream &operator<<(std::ostream &os, const stack &_st) { auto st = _st; vector res; while(!empty(st)) res.emplace_back(st.top()), st.pop(); reverse(all(res)); return os << res; } template std::ostream &operator<<(std::ostream &os, const queue &_qu) { auto qu = _qu; vector res; while(!empty(qu)) res.emplace_back(qu.front()), qu.pop(); return os << res; } template std::ostream &operator<<(std::ostream &os, const deque &_dq) { auto dq = _dq; vector res; while(!empty(dq)) res.emplace_back(dq.front()), dq.pop_front(); return os << res; } template std::ostream &operator<<(std::ostream &os, const priority_queue &_pq) { auto pq = _pq; vector res; while(!empty(pq)) res.emplace_back(pq.top()), pq.pop(); return os << res; } template ostream &operator<<(ostream &os, const pair &p) { if(&os == &cerr) { return os << "(" << p.first << ", " << p.second << ")"; } return os << p.first << " " << p.second; } template std::basic_ostream &operator<<(std::basic_ostream &os, const Container &x) { bool f = true; if(&os == &cerr) os << "["; for(auto &y : x) { if(&os == &cerr) os << (f ? "" : ", ") << y; else os << (f ? "" : " ") << y; f = false; } if(&os == &cerr) os << "]"; return os; } static uint32_t RandXor(){ static uint32_t x=123456789; static uint32_t y=362436069; static uint32_t z=521288629; static uint32_t w=88675123; uint32_t t; t=x^(x<<11); x=y; y=z; z=w; return w=(w^(w>>19))^(t^(t>>8)); } static double Rand01(){ return (RandXor()+0.5)*(1.0/UINT_MAX); } template void rshuffle(vector &V){ random_device seed_gen; mt19937 engine(seed_gen()); shuffle(V.begin(),V.end(),engine); } void solve(){ ll N,X; cin>>N>>X; vl A(2*N); rep(i,N){ cin>>A[i]; A[i+N]=A[i]; } ll sm=0,ans=0; int l=0,r=1; for(;r<=2*N;r++){ sm+=A[r-1]; while(lX){ sm-=A[l]; l++; } chmax(ans,sm); } ll acc=accumulate(A.begin(),A.begin()+N,0LL); cout<