#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("cuburi2.in");
ofstream fout("cuburi2.out");

long long n, m, a, b, num1, num2, num3, an, sub;
long long nums[250010], preL[250010], preR[250010], addL[250010], addR[250010];
long long ans(long long idx)
{
    if(idx < a || idx > b) return 2000000000000000000;
    return addL[idx] + addR[idx+1] - preL[a]*(idx-a) - preR[b+1]*(b-idx) - sub;
}
int bs(int l, int r)
{
    int mid = (l+r)/2;
    if(l == r) return l;
    num1 = ans(mid-1); num2 = ans(mid); num3 = ans(mid+1);
    if(num1 > num2 && num3 > num2) return mid;
    if(num1 <= num2) return bs(l, mid);
    return bs(mid+1, r);
}
int main()
{
    fin >> n >> m;
    for(int i = 0; i < n; i ++)
        fin >> nums[i];
    for(int i = 1; i <= n; i ++)
    {
        preL[i] = preL[i-1] + nums[i-1];
        addL[i] = addL[i-1] + preL[i];
    }
    for(int i = n-1; i >= 0; i --)
    {
        preR[i] = preR[i+1] + nums[i];
        addR[i] = addR[i+1] + preR[i];
    }
    while(m--)
    {
        fin >> a >> b; a--; b--;
        sub = addL[a] + addR[b+1];
        an = bs(a, b);
        fout << an+1 << " " << ans(an) << "\n";
    }
}