#include<cstdio>
#include<math.h>
#include<algorithm>
#include <iostream>
using namespace std;

FILE* in=fopen("rmq.in", "r");
FILE* out=fopen("rmq.out", "w");
int rmq[27][100007], n, m;//rmq[i][j] este minimul pe un interval de lungime 2^i care incepe in j

int main()
{
    fscanf(in, "%d%d", &n, &m);
    for(int i=1; i<=n; ++i)
    {
        fscanf(in, "%d", &rmq[0][i]);
    }
    int lg=log2(n);
    for(int i=1; i<=lg; ++i)
    {
        for(int j=1; j<=n-(1<<i)+1; ++j)
        {
            rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
        }
    }
    for(int i=1; i<=m; ++i)
    {
        int x, y;
        fscanf(in, "%d%d", &x, &y);
        int a=log2(y-x+1);
        //cout<<rmq[a][x]<<" "<<rmq[a][y-(1<<a)]<<" "<<a<<" "<<y-(1<<a)<<"\n";
        fprintf(out, "%d\n", min(rmq[a][x], rmq[a][y-(1<<a)+1]));

    }
}