#include <bits/stdc++.h>
using namespace std;
const int N = 500010;
class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
InParser f("secventa.in");
ofstream g("secventa.out");
deque <pair<int, int>> dq;
deque <pair<int, int>>::iterator it;
int n, k, x, S, start, s[N], v[N], maxi;
int main()
{
    f >> n >> k;
    for(int i = 1; i <= k; i++)
    {
        f >> v[i];
        dq.push_back({v[i], i});
        s[1] += v[i];
    }
    sort(dq.begin(), dq.end());
    tie(maxi, S) = dq.front();
    start = 1;
    for(int i = k + 1; i <= n; i++)
    {
        f >> v[i];
        s[i - k + 1] = s[i - k] - v[i - k] + v[i];
        while(dq.front().second < i - k + 1 && !dq.empty())
            dq.pop_front();
        int st = 0, dr = dq.size();
        while(st < dr)
        {
            int mi = (st + dr) / 2;
            if(dq[mi].first < v[i])
                st = mi + 1;
            else
                dr = mi;
        }
        if(dq[st].second < i && dq[st].first == v[i])
            st++;
        it = dq.begin() + st;
        dq.insert(it, make_pair(v[i], i));
//        for(int j = 0; j < dq.size(); j++)
//            cout << "(" << dq[j].first <<", " << dq[j].second <<"), ";
//        cout << endl;
        int tempV, id;
        tie(tempV, id) = dq.front();
        if(maxi < tempV)
        {
            maxi = tempV;
            start = i - k + 1;
            S = s[start];
        }
        else if(maxi == tempV && s[i - k + 1] > S)
        {
            S = s[i - k + 1];
            start = i - k + 1;
        }
    }
    g << start << ' ' << start + k - 1 << ' ' << maxi;
    return 0;
}