#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <ctype.h>
#include <queue>
#include <cstring>
#include <set>
#include <bitset>
#include <map>
#include <chrono>
#include <random>
#include <unordered_map>
#include <stdio.h>
#include <deque>
#include <iomanip>
#include <stack>
#include <cassert>
using namespace std;
using ll = long long;
#define int long long
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ain(x,n) for(int i=0;i<n;i++)cin>>x[i];
#define aout(x,n) for(int i=0;i<n;i++)cout<<x[i]<<" ";
//#define endl '\n'
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mod=32768;
void solve(int tccc)
{
    int n,k;
    cin>>n>>k;
    int pre[n+1]={};
    int suf[n+2]={};
    int arr[n+1];
    int z=0;
    int zz=0;
    for(int i=1;i<=n;i++)
    {
        cin>>arr[i];
        if(i<=k)
        z+=arr[i];
        if(i>n-k)
        zz+=arr[i];
    }
    for(int i=1;i<=n;i++)
    {
        pre[i]=arr[i]+pre[i-1];
    }

    int sm=0;
    for(int i=1;i<=n;i++)
    {
        //find length
        int y=(i^k);
        if(y+i<=n)
        {
            sm=max(sm,pre[i]+pre[n]-pre[n-y]);
        }
    }
    cout<<max(sm,max(zz,z))<<endl;

}

int32_t main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    for(int i=1;i<=t;i++)
    {
        solve(i);
    }

}