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

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

int n,m;
int v[100005], lg[100005];
int rmq[20][100005];

void Rmq()
{
    for(int i=1; i<=n; i++)
        rmq[0][i]=v[i];
    for(int i=1; (1<<i) <= n; i++)
    {
        for(int j=1; j<=n-(1<<i)+1; j++)
        {
            rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
        }
    }
    for(int i=2; i<=n; i++)
        lg[i]=lg[i/2]+1;
}

int Query(int x, int y)
{
    int log=lg[y-x+1];
    return min(rmq[log][x], rmq[log][y-(1<<log)+1]);
}

void Citire()
{
    fin>>n>>m;
    int x, y;
    for(int i=1; i<=n; i++)
        fin>>v[i];
    Rmq();
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        fout<<Query(x, y)<<"\n";
    }
}


int main()
{
    Citire();
    for(int i=1; (1<<i) <= n; i++)
    {
        for(int j=1; j<=n-(1<<i)+1; j++)
        {
            cout<<rmq[i][j]<<" ";
        }
        cout<<"\n";
    }
    return 0;
}