#include<algorithm>
#include<iostream>
#include<fstream>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#define MAXN 100000
using namespace std;
int hil[MAXN], ans=0, b, e;

void find(int l, int r, int x)
{
	int i, k, now=0;
	for(i=l,k=1;i<=r;i++,k++)
	{
		now=now+hil[i];
		if(k==x)
		{
			if(ans<now)
			{
				b=i-k+1;
				e=i;
				ans=now;
			}
			i=i-(x-1);
			k=0;
			now=0;
		}
	}
}

int main()
{
	ios::sync_with_stdio(false);
	freopen("hill.in","r",stdin);
	freopen("hill.out","w",stdout);
	int n, m, i, j, a, c;
	cin>>n>>m;
	for(i=1;i<=n;i++)
	{
		cin>>hil[i];
	}

	for(i=0;i<m;i++)
	{
		cin>>a>>c;
		for(j=1;j<=c-a+1;j++)
		{
			find(a,c,j);
		}
		cout<<b<<' '<<e<<' '<<ans<<endl;
		ans=-9999999;
	}
	return 0;
}