#include <fstream>
#include <iostream>
#include <math.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[20][100005];
int query(int a, int b)
{
    if (b < a)
    {
        swap(a, b);
    }
    // cout << a << " " << b << '\n';
    int dist = log2(b - a + 1);
    cout << dist << " ";
    return min(rmq[dist][a], rmq[dist][b - (1 << dist) + 1]);
}
int main()
{
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fin >> rmq[0][i];
    }
    for (int k = 1; (1 << k) <= n; k++)
    {
        for (int i = 1; i <= n - (1 << k) + 1; i++)
        {
            rmq[k][i] = min(rmq[k - 1][i], rmq[k - 1][i + (1 << (k - 1))]);
        }
    }
    for (int i = 1; i <= m; i++)
    {
        int a, b;
        fin >> a >> b;
        fout << query(a, b) << '\n';
    }
    return 0;
}