#include <iostream>
using namespace std;

void swap(long*a,long*b);

int main()
{
    int t;
    cin >>t;
    while(t--)
    {
        long n,k;
        cin >>n>>k;
        long a[100000];
        long array_length = n;
        long sum =0;
        for(int i=0;i<n;i++)
        {
            cin >> a[i];
        }
        while(k-1<=(array_length-1))
        {
            if(a[k-1]>a[array_length-k])
            {
                sum += a[k-1]; 
                a[k-1] =0;
            }
            else if (a[k-1]<=a[array_length-k])
            {
                sum +=a[array_length-k];
                a[array_length-k] =0;
            }
            array_length--;
            int count = 1;
            while(count !=0)
            {
                count =0;
                for(int i=0;i<n-1;i++)
                {
                    if(a[i]==0&&a[i+1]>a[i])
                    {
                        swap(&a[i],&a[i+1]);
                        count++;
                    }
                }
            }
        }


        cout << sum<<endl;
    }    
}

void swap(long*a,long*b)
{
    int c;
    c = *b;
    *b = *a;
    *a =c;
}