#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m, rmq[18][100001], e[18], L[18];

int main()
{
    int i, j, x, y, exp, len;
    fin >> n >> m;
    e[1] = 0;
    for (i = 2 ; i <= n ; i++)
        e[i] = e[i / 2] + 1;
    L[0] = 1;
    for (i = 1 ; i <= 18 ; i++)
        L[i] = L[i - 1] * 2;
    for (i = 1 ; i <= n ; i++)
        fin >> rmq[0][i];
    for (i = 1 ; i <= e[n] ; i++)
        for (j = 1 ; j <= n - L[i] + 1 ; j++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + L[i-1]]);
    for (i = 1 ; i <= m ; i++)
    {
        fin >> x >> y;
        j = e[y - x + 1];
        len = L[j];
        fout << min(rmq[j][x], rmq[j][y - len + 1]) << "\n";
    }
    return 0;
}