#include<cstdio>
#include<algorithm>
#include<cstring>
#define INF 1000000000
using namespace std;
int n,i,j,p,q,m,nr,sol;
int a[1005][1005],v[1005];
int main()
{
    freopen("cuburi2.in","r",stdin);
    freopen("cuburi2.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (i=1;i<=n;i++)
    scanf("%d",&v[i]);
    for (i=1;i<=n;i++)
    {
        memset(a[i%2],0,sizeof(a[i]));
        p=INF;
        for (j=1;j<=n;j++)
        {
            a[i][j]=a[(i-1)][j]+(v[i]*(abs(i-j)));
            if (p>a[i][j]) q=j,p=a[i][j];
        }
    }
    while (m--)
    {
        scanf("%d %d",&p,&q); sol=INF;
        for (j=1;j<=n;j++) if (a[q][j]-a[p-1][j]<sol)
        sol=a[q][j]-a[p-1][j],nr=j;
        printf("%d %d\n",nr,sol);
    }
    return 0;
}