#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
#define LOG 16
int rmq[100001][LOG];
int main()
{
    int n, m;
    f >> n >> m;
    for (int i = 1; i <= n; i++)
        f >> rmq[0][i];
    for (int i = 1, l = 2; i <= LOG; i++, l <<= 1)
        for (int j = 1; j <= n - l + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (l >> 1)]);
    while (m--)
    {
        int l, r, t;
        f >> l >> r;
        t = floor(log2(r - l + 1));
        cout << t << ' ';
        g << min(rmq[t][l], rmq[t][r - (1 << t) + 1]) << '\n';
    }
}