#include <iostream>
#include <fstream>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
long int lg[100002], rmq[18][100002], v[100002];
int main()
{
    long int n, m, L;
    long int i, j;
    f >> n >> m;
    for(i = 1; i <= n; i++)
        f >> v[i];

    lg[1] = 0;

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

    for(i = 1; i <= n; i++)
        rmq[0][i] = v[i];

    for (i=1; (1 << i) <= n; i++)
		for (j = 1; j <= n - (1 << i)+1; j++)
		{
            L = 1 << (i-1);
            rmq[i][j] = min(rmq[i-1][j] , rmq[i-1][j+L]);
		}

    long int ls, ld, d, sh;

    for(i = 1; i <= m; i++)
        {
            f >> ls >> ld;
            d = ld - ls + 1;
            L = lg[d];
            sh = d - (1 << L);
            g << min(rmq[L][ls], rmq[L][ls+sh]) << '\n';
        }

    return 0;
}