#include <stdio.h>
#include <stdlib.h>

#define MAX 100000

int sp[20][MAX+1];
int vl[MAX+1];

int min(int nr1, int nr2)
{
    if(nr1<nr2)
        return nr1;
    return nr2;
}
int max(int nr1, int nr2)
{
    if(nr1>nr2)
        return nr1;
    return nr2;
}

void bsp(int n)
{
    int i, j;
    for(i=1; i<=vl[n]; i++)
    {
        for(j=1; j<=n-(1<<(i))+1; j++)
            sp[i][j]=min(sp[i-1][j], sp[i-1][j+(1<<(i-1))]);
    }
}

int main()
{
    FILE *fin, *fout;
    fin=fopen("rmq.in", "r");
    fout=fopen("rmq.out", "w");
    int n, m;
    fscanf(fin, "%d%d", &n, &m);
    int i;
    for(i=2; i<=n; i++)
        vl[i]=1+vl[i/2];
    for(i=1; i<=n; i++)
        fscanf(fin, "%d", &sp[0][i]);
    bsp(n);
    int x, y;
    for(i=0; i<m; i++)
    {
        fscanf(fin, "%d%d", &x, &y);
        fprintf(fout, "%d\n", min(sp[vl[max(x, y)-min(x, y)+1]][min(x, y)],sp[vl[max(x, y)-min(x, y)+1]][max(x, y)-(1<<vl[max(x, y)-min(x, y)+1])+1]);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}