#include <bits/stdc++.h>

using namespace std;

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

int RMQ[18][100001];


int qry(int x,int y)
{
    int put=1;
    int ct=0;
    while (put*2<=y-x+1)
    {
        put=put*2;    ///cea mai mare putere a lui 2 mai mica decat lungimea intervalului
        ct++;
    }
    return min(RMQ[ct][x], RMQ[ct][y-put+1]);   ///returnam valoarea minima

}
int main()
{
    int n,m,x,y;
    fin>>n>>m;
    for (int i=1; i<=n; i++)
        fin>>RMQ[0][i]; ///punem numerele pe prima linie
    for (int i=1,putere=2; putere<=n; i++,putere*=2)
        for (int j=1; j<=n; j++)
        RMQ[i][j]=min(RMQ[i-1][j],RMQ[i-1][j+putere/2]); ///generam tabelul
    for (int i=1; i<=m; i++)
    {
        fin>>x>>y;
        fout<<qry(x,y)<<'\n';
    }
    return 0;
}