#include <fstream>

using namespace std;

ifstream cin ("rmq.in");
ofstream cout ("rmq.out");

const int LogMax = 17;
const int Nmax = 1000005;


int rmq[LogMax][Nmax];
int Log_2[Nmax];

int main()
{
    int n, Q, a;
    cin >> n >> Q;
    for(int i = 0; i < n; ++i)
    {
        cin >> a;
        rmq[0][i] = a;
    }

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

    for(int i = 1; (1 << i) <= n; ++i)
        for(int j = 0; j + (1 << i) <= n; ++j)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);

    int x, y;
    for(int q = 1; q <= Q; ++q)
    {
        cin >> x >> y; // eu incep cu poz de la 0, ei le considera de la 1
        x--;
        y--;
        int linie = Log_2[y - x + 1];
        cout << min(rmq[linie][x], rmq[linie][y - (1 << linie) + 1]) << '\n';
    }
    return 0;
}