#include <fstream>
#include <cstring>
#define DIM 260000
using namespace std;

//ifstream fin ("cuburi2.in" );
//ofstream fout("cuburi2.out");
FILE *fin = fopen("cuburi2.in" ,"r");
FILE *fout= fopen("cuburi2.out","w");

int N, M, i, j, K, ok, minim, X, Y;
long long D1[DIM], D2[DIM], V[DIM];
long long A[DIM], B[DIM], D[DIM];
char S[DIM*10]; int nr;

/*void Parse(){
     fin.get();
     fin.get(S + 1, DIM*10);
     int T = strlen(S + 1);
     N = 0;
     for(i = 1; i <= T; i ++){
          if(S[i] >= '0' && S[i] <= '9'){
               nr = 0;
               while(S[i] >= '0' && S[i] <= '9')
                    nr = nr * 10 + (S[i++] - '0');
               V[++N] = nr;
          }
     }
     return;
}*/

void SetUp(){
    fscanf(fin, "%d %d", &N, &M);
    //Parse();
    for(i = 1; i <= N; i ++){
        fscanf(fin, "%d", &V[i]);
        D[i] = D[i-1] + V[i];
    }
    for(i = 1; i <= N; i ++){
        A[i] = A[i-1] + V[i];
        B[i] = B[i-1] + V[i] * 1LL * i;
    }
    for(i = 1; i <= N; i ++)
        D1[i] = i * A[i] - B[i];
    memset(A, 0, sizeof(A));
    memset(B, 0, sizeof(B));
    for(i = 1; i <= N / 2; i ++)
        swap(V[i], V[N-i+1]);
    for(i = 1; i <= N; i ++){
        A[i] = A[i-1] + V[i];
        B[i] = B[i-1] + V[i] * 1LL * i;
    }
    for(i = 1; i <= N; i ++)
        D2[i] = i * A[i] - B[i];
    for(i = 1; i <= N / 2; i ++)
        swap(V[i], V[N-i+1]);
    for(i = 1; i <= N / 2; i ++)
        swap(D2[i], D2[N-i+1]);
    return;
}

inline long long Valoare(int pos, int st, int dr){
    return D1[pos] - D1[st] - (D[st-1] - D[0]) * (pos - st) + D2[pos] - D2[dr] - (D[N] - D[dr]) * (dr - pos);
}

void CautBin(int st, int dr){
    int p1 = st, p2 = dr;
    while(st <= dr){
        int mid = st + (dr - st) / 2;
        long long val1 = Valoare(mid, p1, p2);
        long long val2 = Valoare(mid-1, p1, p2);
        long long val3 = Valoare(mid+1, p1, p2);
        if(val1 <= val2 && val1 <= val3){
           fprintf(fout, "%d %d\n", mid, val1);
           return;
        }
        if(val3 <= val1)
            st = mid + 1;
        else
            dr = mid - 1;
    }
    return;
}

/*void Test(){
    for(i = 1; i <= N; i ++)
        fout << D1[i] << " ";
    fout << "\n";
    for(i = 1; i <= N; i ++)
        fout << D2[i] << " ";
    fout << "\n";
    return;
}*/

void CodeExpert(){
    //Test();
    //fout << Valoare(1, 1, 2) << "\n";
    for(M = M; M > 0; M --){
        fscanf(fin, "%d %d", &X, &Y);
        CautBin(X, Y);
    }
    return;
}

int main(){
    SetUp();
    CodeExpert();
    return 0;
}