#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, n) for (ll i = 1; i <= n; i++)
ll inf = 1e18 + 67;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t;
    cin >> t;
    while (t--)
    {
        /*
        OBSERVATIONS:

        always equal to their sum

        */
        ll n;cin>>n;vector<ll>a(n+1);f(i,n)cin>>a[i];
        vector<ll>marked(n+1);
        f(i,n){
            ll l=a[i]*i;
            ll r=min(n-1,a[i]*i + i-1);
            for(int j=l;j<=r;j++){
                marked[j]=true;
            }
        }
        vector<ll>b;
        for(int i=0;i<n;i++){
            if(!marked[i])b.push_back(i);
        }
      //  cout<<124<<endl;
        cout<<b.size()<<endl;
        for(auto x:b)cout<<x<<" ";
        cout<<endl;
    }
}

#include <bits/stdc++.h>
using namespace std;
int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, k;
        cin >> n >> k;
        vector<long long> a(n);
        for (auto &x : a) cin >> x;
        long long ans = 0;
        while (a.size() >= k) {
            int m = a.size();
            if (a[k - 1] >= a[m - k]) {
                ans += a[k - 1];
                a.erase(a.begin() + k - 1);
            } else {
                ans += a[m - k];
                a.erase(a.begin() + m - k);
            }
        }

        cout << ans <<endl;
    }
}