#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int MAX = 100000;
int v[MAX+1], mat[MAX+1][101];
int main()
{
    int n, m;
    in>>n>>m;
    for(int i=1; i<=n; ++i)
    {
        in>>v[i];
        mat[0][i]=v[i];
    }
    for(int p=1; (1<<p)<n; ++p)
    {
        for(int i=1; i<=n; ++i)
        {
            mat[p][i] = mat[p-1][i];
            int j=i+(1<<(p-1));
            if(j<=n && mat[p][i] > mat[p-1][j])
                mat[p][i] = mat[p-1][j];
        }
    }
    for(int i=0; (1<<i)<n; ++i)
    {
        for(int j=1; j<=n; ++j)
            cout<<mat[i][j]<<" ";
        cout<<'\n';
    }
    for(int i=1; i<=m; ++i)
    {
        int st, dr;
        in>>st>>dr;
        cout<<mat[st-1][dr]<<" si "<<mat[st-1][dr+(1<<st)]<<endl;
        out<<min(mat[st-1][dr], mat[st-1][dr+(1<<(st-1))] )<<'\n';
    }
    return 0;
}