#include <iostream>
#include <fstream>
using namespace std;

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

const int NMAX = 100002;

int rmq[18][NMAX], lg[NMAX], v[NMAX];
int n, m;

int main()
{
    f >> n >> m;
    for(int i = 1; i <= n; i++)
        f >> v[i];
    lg[1] = 0;
    //
    for(int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    //
    for(int i = 1; i <= n; i++)
        rmq[0][i] = v[i];
    //
    for(int i = 1; (1 << i) <= n; i++)
        for(int j = 1; j <= n - (1 << i) + 1; j++) ///j<=n-2^i+1
        {
            int k = 1 << (i - 1);
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + k]);///j+k<=n-2^(i-1)+1
        }
    //
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        int d = y - x + 1;
        int k = lg[d];
        int sh = d - (1 << k); ///sh=y-x+1-2^k
        g << min(rmq[k][x], rmq[k][x + sh]) << '\n';///x+sh=y-2^k+1
    }
    return 0;
}