#include <bits/stdc++.h>
#define nmax 100007

using namespace std;

ifstream fin ("rmq.in");
ofstream fout ("rmq.out");

int rmq[20][nmax];
int P[nmax], n;

void Puteri(int n)
{
    int i;
    P[1]=0;
    for (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 Q, x, y, len;
    fin >> n >> Q;
    for (int i = 1; i <= n; i++)
        fin >> rmq[0][i];
    Puteri(n);
    RMQ();
    /// interogarile
    while (Q--)
    {
        fin >> x >> y;
        len = P[y - x + 1];
        fout << min(rmq[len][x], rmq[len][y + 1 - (1<<len)]) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}