#include <bits/stdc++.h>

using namespace std;

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

///rmq[i][j] = minimul pe intervalul (j, j + 2^i - 1)
int rmq[20][100005], n, a[100005], p[100005];

void RMQ()
{
    int i, j;
    ///initializare
    for (i = 1; i <= n; i++) rmq[0][i] = a[i];
    ///puteri de 2
    for (i = 2; i <= n; i++) p[i] = p[i / 2] + 1;
    ///calcul rmq
    for (i = 1; i <= p[n]; i++)
        for (j = 1; j <= n - (i << 1) + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}

int main()
{

    int m, x, y, i;
    fin >> n >> m;
    for (i = 1; i <= n; i++) fin >> a[i];
    RMQ();
    while (m--)
    {
        fin >> x >> y;
        i = p[y - x + 1];
        fout << min(rmq[i][x], rmq[i][y - (1 << i) + 1]) << "\n";
    }
    fin.close();
    fout.close();

    return 0;
}