#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int NMAX=100005;
int n,m,arr[NMAX],lookup[NMAX][(int)(log2(NMAX))+5];
inline void preprocess(int arr[],int n)
{
    for(int i=0; i<=n; i++)
        lookup[i][0]=i;
    for(int j=1; (1<<j)<=n; j++)
        for(int i=1; i+(1<<j)-1<=n; i++)
        {
            if(arr[lookup[i][j-1]]<arr[lookup[i+(1<<(j-1))][j-1]])
                lookup[i][j]=lookup[i][j-1];
            else
                lookup[i][j]=lookup[i+(1<<(j-1))][j-1];
        }
}
inline int query(int arr[],int l,int r)
{
    int j=log2(r-l+1);
    if(arr[lookup[l][j]]<=arr[lookup[r-(1<<j)+1][j]])
        return arr[lookup[l][j]];
    else
        return arr[lookup[r-(1<<j)+1][j]];
}
inline void RMQ(int arr[],int n,int m)
{
    int l,r;
    preprocess(arr,n);
    for(int i=1; i<=m; i++)
    {
        f>>l>>r;
        g<<query(arr,l,r)<<"\n";
    }
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
        f>>arr[i];
    RMQ(arr,n,m);
    return 0;
}