#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

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

int n, q, xx, yy;
int v[100001], lg[100001];
int rmq[18][100001];
int l, diff;

int main()
{
    in>>n>>q;
    for(int i=1; i<=n; i++) in>>v[i], lg[i+1]=lg[(i+1)/2]+1, rmq[0][i]=v[i];
    for(int i=1; (1<<i)<=n; i++)
        for(int j=1; j+(1<<i)-1<=n; j++)
    {
        l=1<<(i-1);
        rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+l]);
    }
    while(q--)
    {
        in>>xx>>yy;
        diff=yy-xx+1;
        l=lg[diff];
        out<<min(rmq[l][xx], rmq[l][xx+diff-(1<<l)])<<'\n';
    }
    return 0;
}