#include <iostream>
#include <string.h>
#include <random>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <iomanip>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <valarray>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
typedef pair<string, string> pss;
typedef pair<int, char> pic;
typedef pair<pii, int> piii;
typedef pair<double, double> pdd;
typedef pair<float, float> pff;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ull, ull> pull;
typedef complex<double> cd;
//#define max(n, m) ((n>m)?n:m)
//#define min(n, m) ((n<m)?n:m)
#define f first
#define s second
#define input() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

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

int l, r, mid;
ll n, m, a, b, num1, num2, num3, an;
ll nums[250010], preL[250010], preR[250010], addL[250010], addR[250010];
ll ans(ll idx)
{
    if(idx < a || idx > b) return 2000000000000000000;
    return addL[idx] + addR[idx+1] - preL[a]*(idx-a) - addL[a] - preR[b+1]*(b-idx) - addR[b+1];
}
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--;
        an = bs(a, b);
        while(l != r)
        {
            mid = (l+r)/2;
            if(l == r) {an = l; break;}
            num1 = ans(mid-1); num2 = ans(mid); num3 = ans(mid+1);
            if(num1 > num2 && num3 > num2) {an = mid; break;}
            if(num1 <= num2) r = mid;
            else l = mid+1;
        }
        fout << an+1 << " " << ans(an) << "\n";
    }
}