#include <bits/stdc++.h>
#define in "rmq.in"
#define out "rmq.out"
#define N 100003
using namespace std;
ifstream fin(in);
ofstream fout(out);

int n;
int rmq[20][N];
int P[N];

void Puteri(int n)
{
    P[1] = 0;
    for (int i = 2; i <= n; i++)
        P[i] = 1 + P[i/2];
}

void RMQ()
{
    int i,j,L;

    L = P[n];
    for (i = 1; i <= L; i++)
        for (j = 1; j <= n - (1 << i) + 1; j++)
            rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j + (1<<(i-1))]);
}

int main()
{
    int i,Q,x,y,len;

    fin >> n >> Q;
    for (i = 1; i <= n ; i++)
        fin >> rmq[0][i];
    Puteri(n);
    RMQ();

    while(Q--)
    {
        fin >> x >> y;
        len = P[y-x+1];
        fout << min(rmq[len][x], rmq[len][y - (1<<len) + 1]) << "\n";
    }

    fin.close();
    fout.close();
    return 0;
}