#include <bits/stdc++.h>
using namespace std;


void helper(vector<int>&nums,int n,vector<pair<int,int>>&firstAndLast,vector<bool>&present,vector<vector<int>>&pref){
    
    for(int i=0;i<n;i++){
        int num=nums[i];
        //pref update
        pref[i+1]=pref[i];
        pref[i+1][num]++;
        
        //firstAndLast
        if(firstAndLast[num].first==-1){
            firstAndLast[num]={i,i};
        }else{
            firstAndLast[num].second=i;
        }
        
        //present
        present[num]=true;
    }
}

int solve(vector<int>&nums,int st,int end,int k,vector<vector<int>>&pref){
   
   if(k==1){
       return max(nums[st-1],nums[end+1]);
   } 
   if(k==2){
       return nums[st-1]+nums[end+1];
   }
   k-=2;
   
   int ans=nums[st-1]+nums[end+1];
   int cur=50;
   
   while(k>0&&cur>=1){
       int count=pref[end+1][cur]-pref[st][cur];
       
       int taken=min(count,k);
       k-=taken;
       ans+=cur*taken*2;
       cur--;
       
   }
   if(k>0)return INT_MIN;
   return ans;
}
int main() {
	// your code goes here
     
     int test;
     cin>>test;
     
     
     while(test--){
         int n,k;
         cin>>n>>k;
         
         vector<int>nums(n);
         for(int i=0;i<n;i++){
             cin>>nums[i];
         }
         
         //find the first and last occurance
         vector<pair<int,int>>firstAndLast(51,{-1,-1});
         vector<bool>present(51,false);//if elemnt is preent or not
         vector<vector<int>>pref(n+1,vector<int>(51,0));//pref count only 50 elemnts
         helper(nums,n,firstAndLast,present,pref);
         
         int ans=0;
         
         for(int i=1;i<=50;i++){
             if(present[i]){
                 for(int j=1;j<=50;j++){
                     if(present[j]){
                         int st=firstAndLast[i].first;
                         int end=firstAndLast[j].second;
                         if(st<end){
                             ans=max(ans,solve(nums,st+1,end-1,k,pref));
                         }
                     }
                 }
             }
         }
         cout<<ans<<endl;
         
     }
}