#include <cstdio>
#include <algorithm>

using namespace std;

const int NMAX = 100005;
const int LMAX = 20;

int rmq[LMAX][NMAX];
int lg[NMAX];
int v[NMAX];
int n,m,l,temp;

int query(int x,int y)
{
    int diff = y-x+1;
    l = lg[diff];
    temp = diff-(1<<l);
    return min(rmq[l][x],rmq[l][x+temp]);
}

int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i = 1 ; i <= n ; i++)
        scanf("%d",&v[i]);
    for(int i = 1 ; i <= n ; i++)
        rmq[0][i] = v[i];
    lg[0] = 1;
    for(int i = 2 ; i <= n ; i++)
        lg[i] = lg[(i>>1)]+1;
    for(int i = 1 ; (1<<i) <= n ; i++)
    {
        for(int j = 1 ; j <= n-(1<<i)+1 ; j++)
        {
            l = (1<<(i-1));
            rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j+l]);
        }
    }
    int a,b;
    for(int i = 1 ; i <= m ; i++)
    {
        scanf("%d%d",&a,&b);
        printf("%d\n",query(min(a,b),max(a,b)));
    }
    return 0;
}