#include <bits/stdc++.h>

using namespace std;

constexpr int NMax=100005;
constexpr int LgMax=18;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int N,M;
int RMQ[LgMax][NMax];
int lg[NMax];

inline int Query(int x,int y)
{
    int l=lg[y-x+1];
    return min(RMQ[l][x],RMQ[l][y-(1<<l)+1]);
}

int main()
{
    fin>>N>>M;
    for(int i=0;i<N;i++)
        fin>>RMQ[0][i];

    for(int i=2;i<=N;i++)
        lg[i]=lg[i/2]+1;

    for(int i=1;(1<<i)<=N;i++)
        for(int j=0;j+(1<<i)-1<N;j++)
            RMQ[i][j]=min(RMQ[i-1][j],RMQ[i-1][j+(1<<(i-1))]);

    for(;M;M--)
    {
        int x,y;
        fin>>x>>y;
        fout<<Query(x-1,y-1)<<"\n";
    }

    return 0;
}