#include<cstdio>
#include<iostream>
#include<cstring>
#include<ctime>
#include<algorithm>
using namespace std;

const int maxn=100050;
const int INF=2147483647;

char buf[40];
int n,m,s[maxn];

template<class T> inline bool getd(T& x)
{
	int ch=getchar();
	bool neg=false;
	while(ch!=EOF && ch!='-' && !isdigit(ch)) ch=getchar();
	if(ch==EOF) return false;
	if(ch=='-'){
		neg=true;
		ch=getchar();
	}
	x=ch-'0';
	while(isdigit(ch=getchar())) x=x*10+ch-'0';
	if(neg) x=-x;
	return true;
}

template<class M> inline void putd(M x)
{
	int p=0;
	if(x<0){
		putchar('-');
		x=-x;
	}
	if(x==0) buf[p++]=0;
	while(x){
		buf[p++]=x%10;
		x/=10;
	}
	for(int i=p-1;i>=0;i--) putchar(buf[i]+'0');
}

void init()
{
	getd(n);getd(m);
	for(int i=0;i<n;i++){
		getd(s[i]);
		if(i) s[i]+=s[i-1];
	}
}

void work()
{
	int mini;
	for(int i=0;i<m;i++){
		int x,y,min1,ans=-INF,ansi,ansj;
		getd(x);getd(y);
		x--;
		min1=x==0?0:s[x-1];
		mini=x;
		for(int i=x;i<y;i++){
			if(ans<s[i]-min1){
				ans=s[i]-min1;
				ansi=mini;
				ansj=i;
			}
			if(min1>s[i]){
				min1=s[i];
				mini=i+1;
			}
		}
		printf("%d %d %d\n",ansi+1,ansj+1,ans);
	}
}

int main()
{
	freopen("hill.in","r",stdin);
	freopen("hill.out","w",stdout);
	init();
	work();
	fclose(stdin);
	fclose(stdout);
	return 0;
}