#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

ifstream f("deque.in");
ofstream g("deque.out");

deque<int>dq;

int n,k,suma=0, sir[5000002];

int main()
{
    f>>n>>k;
    for(int i=0; i<n; i++){
        f>>sir[i];
        while(!dq.empty() && (sir[dq.back()]()>sir[i]))
            dq.pop_back();
        while(!dq.empty() && dq.front()<=i-k+1)
            dq.pop_front();

        dq.push_back(make_pair(nr,i));

        if(i>=k-1 && i<=i-k)
            suma+=dq.front().first;
        cout<<dq.front().first<<" "<<dq.back().second<<endl;
    }
    cout<<suma<<endl;
    return 0;
}