#include <iostream>
#include <fstream>

using namespace std;

ifstream in("rmq.in");
ofstream out("rmq.out");
const int NMAX = 100001;
int n,m;
int a[NMAX];
int lg[NMAX];
int sp[NMAX][18];

int main()
{
    in>>n>>m;
    for(int i=0;i<n;i++)
        {
            in>>a[i];
            sp[i][0] = i;
        }
    for(int i=2;i<=n;i++)
        lg[i] = lg[i/2] + 1;
    for(int j=1;(1<<j)<=n;j++)
        for(int i = 0;i+(1<<j)-1<n;i++)
            if(a[sp[i][j-1]] <= a[sp[i+(1<<(j-1))][j-1]])
                sp[i][j] = sp[i][j-1];
            else
                sp[i][j] = sp[i+(1<<(j-1))][j-1];
    int x,y;
    int k;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        x--;
        y--;
        k = lg[y-x+1];
        if(a[sp[x][k]] <= a[sp[y-(1<<k)+1][k]])
            out<<a[sp[x][k]]<<"\n";
        else
            out<<a[sp[y-(1<<k)+1][k]]<<"\n";
    }
    in.close();
    out.close();
    return 0;
}