#include <stdio.h>
#define N 250005
long long n,m,v[N];
long long sum[N],sum2[N],sum3[N];
long long x,y,numar;
void precalculate()
{
	long long i;
	for (i=1; i<=n; i++)
	{
		scanf("%lld",&v[i]);
		sum[i]=sum[i-1]+v[i];
		sum2[i]=sum2[i-1]+sum[i-1];
	}
	for (i=n; i>=1;i--)
		sum3[i]=sum3[i+1]+sum[n]-sum[i];
}
long long cbin()
{
	long long i,step;
	for (step=1; step<=y-x+1; step<<=1);
	for (i=x-1; step; step>>=1)
		if (i+step<=y && sum[i+step]-sum[x-1]<numar)
			i+=step;
	return ++i;
}
int main()
{
	freopen("cuburi2.in","r",stdin);
	freopen("cuburi2.out","w",stdout);
	scanf("%lld%lld",&n,&m);
	precalculate();
	long long i,t,rez;
	for (i=1; i<=m; i++)
	{
		scanf("%lld%lld",&x,&y);
		numar=(sum[y]-sum[x-1])/2;
		t=cbin();
		rez=sum2[t]-sum2[x]-sum[x-1]*(t-x);
		rez+=sum3[t]-sum3[y]-(sum[n]-sum[y])*(y-t);
		printf("%lld ",t);
		printf("%lld\n",rez);
	}
	return 0;
}