#include<algorithm>
using namespace std;
int n,m,a[250001];
void solve(){
	int i,j,k,x,y,poz;
	long long int t,min;
	scanf("%d%d",&n,&m);
	for(i=1; i<=n; ++i)
		scanf("%d",&a[i]);
	for(i=1,min=1000001; i<=m; ++i,min=1000001){
        scanf("%d%d",&x,&y);
        for(j=x,t=0; j<=y; ++j,t=0){
            for(k=x; k<j; ++k)
                t+=a[k]*(j-k);
            for(k=j+1; k<=y; ++k)
                t+=a[k]*(k-j);
			if(t<min){
				min=t;
                poz=j;}}
        printf("%d %lld\n",poz,min);}}
int main(){
    freopen("cuburi2.in","r",stdin);
    freopen("cuburi2.out","w",stdout);
    solve();
    return 0;}