#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int NMAX=100005,K=log2(NMAX)+2;
int n,m,v[NMAX],logs[NMAX],lookup[NMAX][K];
void preprocess_logs()
{
    logs[1]=0;
    for(int i=2; i<=NMAX; i++)
        logs[i]=logs[i/2]+1;
}
void preprocess_sparse()
{
    for(int i=0; i<=n; i++)
        lookup[i][0]=i;
    for(int j=1; (1<<j)<=n; j++) //better complexity than just going for j<=K
        for(int i=1; i+(1<<j)-1<=n; i++)
        {
            int part1=lookup[i][j-1],part2=lookup[i+(1<<(j-1))][j-1];
            if(v[part1]<v[part2])
                lookup[i][j]=part1;
            else
                lookup[i][j]=part2;
        }
}
int query(int l,int r)
{
    int j=logs[r-l+1];
    return min(v[lookup[l][j]],v[lookup[r-(1<<j)+1][j]]);
}
void rmq()
{
    int l,r;
    preprocess_logs();
    preprocess_sparse();
    for(int i=1; i<=m; i++)
    {
        f>>l>>r;
        g<<query(l,r)<<"\n";
    }
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
        f>>v[i];
    rmq();
    return 0;
}