#include <iostream>
#include <fstream>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int n, m, x, y;
int rmq[20][100005];
int log2[100005];

int query(int a, int b)
{
    int i=log2[b-a+1];
    return min(rmq[i][a], rmq[i][b-(1<<i)+1]);
}

int main()
{
    f >> n >> m;
    for (int i = 1; i <= n; i++) f >> rmq[0][i];

    for (int i = 2; i <= n; i++)
        log2[i]=log2[i/2]+1;

    for (int i = 1; (1<<i) <= n; i++)
        for (int j = 1; j+(1<<(i-1)) <= n; j++)
        {
            int x=rmq[i-1][j];
            int y=rmq[i-1][j+(1<<(i-1))];
            rmq[i][j]=min(x, y);
        }
    while (m--)
    {
        f >> x >> y;
        g << query(x, y) << '\n';
    }

    return 0;
}