#include <bits/stdc++.h>

using namespace std;

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

const int MAXN = 320000;
const long long INF = 1e18;

int n;

long long st[MAXN + 1], dr[MAXN + 1], sl[MAXN + 1];

int h[MAXN + 1];
int good;
void preprocesare () {
  int i;
  for (i = 1; i <= n; i++)
    sl[i] = sl[i - 1] + h[i];
  for (i = 1; i <= n; i++)
    st[i] = st[i - 1] + sl[i - 1];
  for (i = n; i > 0; i--)
    dr[i] = dr[i + 1] + (sl[n] - s[i]);
}

inline pair <long long, long long> sol (int copst, int l, int r) {
  if (copst < l || copst > r)
    return {INF, INF};
  long long valst = (st[copst] - st[l] * (sl[copst - 1] - sl[l - 1]));
  long long valdr = (dr[copst + 1] - dr[r] * (sl[r] - sl[copst]);
  return {valst, valdr};
}

inline long long solve (int l, int r) {
  long long mn;
  int st = l;
  int dr = r;
  mn = sol (l, l, r).first + sol (l, l, r).second;
  good = l;
  while (st <= dr) {
    int mid = (st + dr) / 2;
    pair <long, long> rez = sol (mid, l, r);
    if (mn > rez.first + rez.second) {
        mn = rez.first + rez.second;
        good = mid;
    }
    if (rez.first < rez.second)
        st = mid + 1;
    else
        dr = mid - 1;
  }
  return mn;
}

int main() {
  int q, l, r;
  fscanf (fin, "%d%d", &n, &q);
  for (int i = 1; i <= n; i++)
    fscanf (fin, "%d", &h[i]);
  preprocesare ();
  while (q--) {
    fscanf (fin, "%d%d", &l, &r);
    long long sol = solve (l, r);
    fprintf (fout, "%d %lld\n", good, sol);
  }
  fclose (fin);
  fclose (fout);
  return 0;
}