#include<iostream>
#include<math.h>
#include <fstream>
using namespace std;

using namespace std;

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

int a[17][100001];

int main()
{
    int n,m;
    f>>n>>m;
    for (int i=1; i<=n; i++)
        f>>a[0][i];
    int log=1;
    int linMax=0;
    while(log<=n)
        log*=2,linMax++;
    for (int i=1;i<=linMax;i++)
        for (int j=1; j<=n; j++)
            a[i][j]=min(a[i-1][j],a[i-1][j+1<<(i-1)]);
    for (int i=0; i<m; i++)
    {
        int x,y;
        f>>x>>y;
        int log=1;
        int linie=0;
        while(log<=y-x+1)
        {
            log*=2;
            linie++;
        }
        linie--;
        log/=2;
        g<<min(a[linie][x],a[linie][y-log+1])<<"\n";

    }
    return 0;
}