#include <fstream>
#include <vector>
#include <iostream>

using namespace std;

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

int n, m;
vector <int> V, Lg;
int RMQ[100001][17];

void RMQ_Process()
{
    for (int i = 1; i <= n; ++i)
        RMQ[i][0] = i;
    for (int j = 1; (1 << j) < n; ++j)
    {
        int val = n - (1 << (j - 1));
        for (int i = 1; i <= val; ++i)
        {
            int l = i + (1 << (j - 1));
            if (V[RMQ[i][j - 1]] < V[RMQ[l][j - 1]] )
                RMQ[i][j] = RMQ[i][j - 1];
            else
                RMQ[i][j] = RMQ[l][j - 1];
        }
    }
    for (int i = 2; i <= n; ++i)
        Lg[i] = Lg[i >> 1] + 1;
}


int main()
{
    f >> n >> m;
    V = Lg = vector <int> (n + 1);
    for (int i = 1; i <= n; ++i)
        f >> V[i];
    RMQ_Process();
    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        f >> x >> y;
        int k = Lg[y - x + 1];
        g << min(V[RMQ[x][k]], V[RMQ[y - (1 << k) + 1][k]]) << "\n";
    }
    f.close();
    g.close();
    return 0;
}