#include <iostream>
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

vector< vector<int> > RMQ;
vector<int> logg;
int N, M, logMaxN;

void Read();
void Solve();
void RangeMinimumQuery();
int main()
{
    Read();
    Solve();
    return 0;
}
void RangeMinimumQuery()
{
    logg.assign(2, 0);
    for(int i=2, carry = 1; i<=2*N; i++, carry++)
    {
        logg.push_back(logg[i-1]);
        if(carry >> logg[i-1] & 1)
            logg[i]++, carry = 0;
    }
    for(int k=1; k<=logMaxN; ++k)
        for(int i=1; i<=N; ++i)
            RMQ[i][k] = min(RMQ[i][k-1], RMQ[i + (1<<(k-1))][k-1]);
}
void Solve()
{
    RangeMinimumQuery();
    while(M--)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        int k = logg[b - a + 1];
        cout<<min( RMQ[a][k], RMQ[b - (1<<k) + 1][k] )<<'\n';
    }
}
void Read()
{
    freopen("rmq.in", "rt", stdin);
    freopen("rmq.out", "wt", stdout);
    scanf("%d%d", &N, &M);
    logMaxN = log(N+10);
    vector<int> aux;
    aux.assign(logMaxN+2, 0);
    RMQ.assign(2 * N, aux);
    for(int i=1; i<=N; ++i)
        scanf("%d", &RMQ[i][0]);
}