#include <bits/stdc++.h>

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

int n, m, i, j, x, y;

int d[200005][20];

int putere(int x,int y)
{
    int p=1;
    while(y) /// x la puterea y
    {
        p=p*x;
        y--;
    }
    return p;
}

int putereaprox(int x)
{
    int p=1,nr=0;
    while(p*2<x)
    {
        p=p*2;
        nr++;
    }
    return nr;
}

int main()
{
    fin >> n >> m;
    for(i=1;i<=n;i++)
    {
        fin >> d[i][0];
    }
    for(j=1; j<=min(n,17); j++)
        for(i=1;i<=n;i++)
    {
        d[i][j]=min(d[i][j-1],d[i+putere(2,j-1)][j-1]);
    }
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        int l=putereaprox(y-x+1);
        fout <<min(d[x][l],d[y-putere(2,l)+1][l])<<'\n';
    }
    return 0;
}