#include <stdio.h>
#include <algorithm>
#include <iomanip>
using namespace std;
int N,M;
FILE *fi, *fo;
int A[100001];
int Table[100001][18];
int k,p;
int main()
{
    fi=fopen("rmq.in","r");
    fo=fopen("rmq.out","w");
    fscanf(fi,"%d%d",&N,&M);
    for (int i=1;i<=N;i++)
        fscanf(fi,"%d",&A[i]);
    /// se construieste sparse table
    for (int i=1;i<=N;i++)
        Table[i][0]=A[i];
    p=1;
    k=0;
    while ((p<<1)<=N)
    {
        p=p<<1;
        k++;
    }
    for (int j=1;j<=k;j++)
        for (int i=1;i<=N-(1<<j)+1;i++)
            Table[i][j]=min(Table[i][j-1],Table[i+(1<<(j-1))][j-1]);

    /// se citesc intrebarile si se da raspunsul
    for (int q=1;q<=M;q++)
    {
        int L,R;
        fscanf(fi,"%d%d",&L,&R);
        if (L>R)
            swap(L,R);
        int rez;
        rez=1000000;
        for (int i=k;i>=0;i--)
            if (L+(1<<i)-1<=R)
            {
                rez=min(rez,Table[L][i]);
                L=L+(1<<i);
            }
        fprintf(fo,"%d\n",rez);
    }
    fclose(fi);
    fclose(fo);
    return 0;
}