#include <bits/stdc++.h>
#define nmax 100003
using namespace std;

int n, Q;
int rmq[18][nmax];
int P[nmax];

/**
    rmq[i][j] = minimul de la poz (j) la poz (2 ^ i)
    rmq[2][3] = min(a3, a4);
*/

void Puteri(int n) ///Precalculare vector p - maxim 2^p <= Lung secv
{
    P[1] = 0;
    for (int i = 2; i <= n; i++)
        P[i] = 1 + P[i / 2];
}

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

    fout.close();
    return 0;
}