#include <iostream>
#define INF 2000000000
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m;
int T[100001][20];
int k,p;

int query(int st, int dr)
{
    int rez;
    rez=INF;
    for (int c=k;c>=0;c--)
        if (st+(1<<c)-1<=dr)
        {
            rez=min(rez,T[st][c]);
            st=st+(1<<c);
        }
    return rez;
}

int main()
{
    fin>>n>>m;
    for (int i=1;i<=n;i++)
        fin>>T[i][0];
    k=0;
    p=1;
    while (p*2<=n)
    {
        p=p*2;
        k++;
    }
    /// se construieste T
    for (int col=1;col<=k;col++)
        for (int i=1;i<=n-(1<<col)+1;i++)
            T[i][col]=min(T[i][col-1],T[i+(1<<(col-1))][col-1]);
    /// se citesc interogarile si se raspunde la ele
    for (int i=1;i<=m;i++)
    {
        int st,dr;
        fin>>st>>dr;
        fout<<query(st,dr)<<"\n";
    }
    return 0;
}