#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#define cler(arr, val)    memset(arr, val, sizeof(arr))
#define FOR(i,a,b)  for(int i=a;i<=b;i++)
#define IN   freopen ("in.txt" , "r" , stdin);
#define OUT  freopen ("out.txt" , "w" , stdout);
typedef long long  LL;
const int MAXN = 510011;
const int MAXM = 6000010;
const int INF = 0x3f3f3f3f;
const LL mod = 2147483647;
const double eps= 1e-8;
const double pi=acos(-1.0);
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1
#define maxnode 40101
#define sigma_size 257
LL a[1111];
int main()
{
    int t,n;
    cin>>t;
    while(t--)
    {
        int n;
        LL p;
        scanf("%d%I64d",&n,&p);
        for(int i=0;i<n;i++)
            scanf("%I64d",&a[i]);
        LL ans=-1e10;
        for(int i=0;i<n;i++)
        {
            LL minn=1e10;
            LL xx=0;
            for(int j=i;j<n;j++)
            {
                minn=min(minn,a[j]);
                if(i==0&&j==n-1)
                {
                    ans=max(ans,xx+a[j]+p-minn);
                }
                else if(minn<p)
                {
                    ans=max(ans,xx+a[j]+p-minn);
                }
                else ans=max(ans,xx+a[j]);
                xx+=a[j];
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}