#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN = 1000100;
int num[MAXN << 1];
int Q[MAXN << 1];
int sum[MAXN << 1];
int main(){
    int T, n, k;
    scanf("%d", &T);
    while(T--){
        scanf("%d%d", &n, &k);
        int head = 0, tail = -1;
        sum[0] = 0;
        for(int i = 1; i <= n; i++){
            scanf("%d", num + i);
            sum[i] = sum[i - 1] + num[i];
        }
        for(int i = n + 1; i <= n + k; i++){
            num[i] = num[i - n];
            sum[i] = sum [i - 1] + num[i];
        }
        int ans = -0x3f3f3f3f, L = 0, R = 0;
        for(int i = 1; i < n + k; i++){
            while(head <= tail && sum[i - 1] < sum[Q[tail]])
                tail--;
            while(head <= tail && i - Q[head]> k)head++;
            Q[++tail] = i - 1;
            if(sum[i] - sum[Q[head]] > ans){
                ans = sum[i] - sum[Q[head]];
                L = Q[head] + 1;
                R = i;
            }
        }
        printf("%d %d %d\n", ans, L>n?L-n:L, R>n?R-n:R);
    }
    return 0;
}

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN = 1000010;
int num[MAXN];
int main(){
    int T;
    int n, k;
    scanf("%d", &T);
    while(T--){
        scanf("%d%d", &n, &k);
        for(int i =0 ; i < n; i++){
            scanf("%d", num + i);
        }
        for(int i = n; i < 2 * n; i++)
            num[i] = num[i - n];
            int l = 0, r = 0, ans = -0x3f3f3f3f, cur = 0, L = 0, R = 0, cnt = 0;
        for(int i = 0; i < 2 * n; i++){
            cur += num[i];
            cnt++;
            if(cur <= num[i] || cnt > k){
                l = i;
                cur = num[i];
                cnt = 1;
            }

            r = i;
            if(cur > ans){
                L = l;
                R = r;
                ans = cur;
            }
        }
        printf("%d %d %d\n", ans, L + 1 > n ? L + 1 - n: L + 1, R + 1 > n ? R + 1 - n: R + 1);
    }
    return 0;
}