#include <bits/stdc++.h>
using namespace std;

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

int n, Q;
int a[100005], e[100005], rmq[18][100005];

void BuildRMQ()
{
    int i, j, L;
    e[1] = 0;
    for (i = 2; i <= n; i++)
        e[i] = 1 + e[i / 2];

    for (i = 1; i <= n; i++)
        rmq[0][i] = a[i];
    for (i = 1; i <= e[n]; i++)
    {
        L = (1 << i);
        for (j = 1; j <= n - L / 2; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + L / 2]);
    }
}

int main()
{
    int i, j, L, expo;
    fin >> n >> Q;
    for (i = 1; i <= n; i++)
        fin >> a[i];

    BuildRMQ();
    while (Q--)
    {
        fin >> i >> j;
        expo = e[j - i + 1];
        L = (1 << expo);
        cout << expo << " " << L << "\n";
        fout << min(rmq[expo][i], rmq[expo][j - L + 1]) << "\n";
    }
    
    return 0;
}