#include <bits/stdc++.h>
#define NMax 100006
using namespace std;
/**
constructia lui rmq[][]:
k - maxim cum (2 la k) <= n

for(i = 1; i <= n; i++)
    rmq[0][i] = a[i];
for(i = 1; i <= k; i++)
    for(j = 1; j <= n - (1 << k) + 1; j++)
        rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1)));

rmq[i][j] = valoarea minima din intervalul [j, j + (2 la i) - 1];
*/

ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[20][NMax];
int n, m;
int P[NMax];
void Putere(int n)
{
    int i;
    P[1] = 0;

    for(i = 2; i <= n; i++)
        P[i] = 1 + P[i / 2];
}

void RMQ()
{
    int i, L = P[n], j;

    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, x, y, len;
    fin >> n >> m;

    for(i = 1; i <= n; i++)
        fin >> rmq[0][i];
    Putere(n);
    RMQ();
    while(m--)
    {
        fin >> x >> y;

        len = P[y - x + 1];
        fout << min(rmq[len][x], rmq[len][y + 1 - (1 << len)]) << "\n";
    }
    return 0;
}