#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <vector>
#include <climits>
#include <bitset>

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

int mat[43][100010];
int lg[100010],x,y,l;
int n,m;
int main()
{
    f>>n>>m;
     for(int i=2; i<=100010; i++)
        lg[i] = lg[i/2] + 1;
    for(int i=1;i<=n;i++)
    {
         f>>mat[0][i];
    }

    for(int i=1; i<=lg[n]; i++)
        for(int j=1; j<=n-(1<<i)+1; j++)
           {
                mat[i][j] = min(mat[i-1][j], mat[i-1][j+(1<<(i-1))]);
           }
    while(m--)
    {
        f>>x>>y;
        l = x-y+1;
        g<<min(mat[lg[l]][x], mat[lg[l]][y-(1<<lg[l])+1])<<'\n';
    }
    return 0;
}