#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
using namespace std;
int map[1000005][20];
int n;
void work()
{
    for(int j=1;1<<j<=n;j++)
    for(int i=1;i+(1<<j)-1<=n;i++)
    map[i][j]=min(map[i][j-1],map[i+(1<<j-1)][j-1]);
}
int question(int z,int y)
{
    int x=int (log(y-z+1)/log(2));
    return min(map[z][x],map[y-(1<<x)+1][x]);
}
int main()
{
    int a,b,k;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
    scanf("%d",&map[i][0]);
    work();
    for(int i=1;i<=k;i++)
        {
            scanf("%d%d",&a,&b);
            printf("%d\n",question(a,b));
        }
    return 0;
}