#include <iostream>
#include <fstream>
using namespace std;
int v[100001];
int r[20][100001];
int p[100001];
int main() {
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    int n, i, q, j, st, dr;
    fin>>n>>q;
    for (i=1;i<=n;i++) {
        fin>>v[i];
    }
    r[0][1]=v[1];
    for (i=2;i<=n;i++) {
        p[i]=p[i/2]+1;
        r[0][i]=v[i];
    }
    for(i=1;(1<<i)<=n;i++) {
        for(j=1;j<=n;j++) {
            r[i][j]=min(r[i-1][j],r[i-1][j+(1<<(i-1))]);
            cout<<r[i][j]<<' ';
        }
        cout<<'\n';
    }
    for (i=0;i<q;i++) {
        fin>>st>>dr;
        cout<<p[dr-st+1]<<' '<<st<<' '<<dr-(1<<p[dr-st+1])+1<<'\n';
        fout<<min(r[p[dr-st+1]][st],r[p[dr-st+1]][dr-(1<<p[dr-st+1])+1])<<'\n';
    }
    return 0;
}