#include<fstream>
#include<cstring>
#include<cmath>
#define tree 1,N,1
#define left l,m,2*p
#define right m+1,r,2*p+1
#define MAXN 100001
#define L t[2*p]
#define R t[2*p+1]
using namespace std;
ifstream fin("hill.in");
ofstream fout("hill.out");
int M,N,n[MAXN]={0},a,b;
int main()
{
	fin>>N>>M;
	for(int i=1;i<=N;i++)
	{
		fin>>n[i];
		n[i]+=n[i-1];
	}
	for(int i=1;i<=M;i++)
	{
		fin>>a>>b;
		int ans=-0x7fffffff,l,r;
		for(int j=a;j<=b;j++)
		{
			for(int k=j;k<=b;k++)
			{
				if(ans<n[k]-n[j-1])
				{
					ans=n[k]-n[j-1];
				    l=j;r=k;
				}
			}
		}
		fout<<l<<" "<<r<<" "<<ans<<endl;
	}
	return 0;
}