#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

int main()
{
    ifstream inputFile("rmq.in");
    ofstream outputFile("rmq.out");

    long int n, m;
    inputFile >> n >> m;

    vector<long int> a(n + 1);
    for (long int i = 1; i <= n; i++)
        inputFile >> a[i];

    long int lmax = log2(n) + 1;
    vector<vector<long int>> rmq(lmax, vector<long int>(n + 1));

    for (long int i = 1; i <= n; i++)
        rmq[0][i] = a[i];

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

    for (long int i = 0; i < m; i++)
    {
        long int x, y;
        inputFile >> x >> y;

        long int diff = y - x + 1;
        long int l = log2(diff);
        long int sh = diff - (1 << l);

        long int minVal = min(rmq[l][x], rmq[l][x + sh]);
        outputFile << minVal << "\n";
    }

    inputFile.close();
    outputFile.close();

    return 0;
}