#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int RMQ[100001][17];
int query(int x, int y)
{
    int L=y-x+1;
    int P=0;
    while(1<<(P+1)<=L)
        P++;
    return min(RMQ[x][P],RMQ[y-(1<<P)+1][P]);
}
int main()
{
    int n,m;
    fin>>n>>m;
    int col=0,cn=n;
    while(cn)
    {
        cn>>=1;
        col++;
    }
    for(int i=1;i<=n;i++)
        fin>>RMQ[i][0];
    for(int j=1;j<col;j++)
        for(int i=1;i<=n-(1<<j)+1;i++)
            RMQ[i][j]=min(RMQ[i][j-1],RMQ[i+(1<<(j-1))][j-1]);

    int x,y;
    for(int i=1;i<=m;i++){
        fin>>x>>y;
        fout<<query(x,y)<<endl;
    }
    return 0;
}