#include <iostream>
#include <fstream>

using namespace std;

const int nMax = 100005;
const int logMax = 20;

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

int v[nMax];
int log[nMax];
int r[logMax][nMax];

int n, m;

int main()
{
    in >> n >> m;
    for(int i = 1; i <= n; ++i)
        in >> v[i];

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

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

    int maxJ, last;
    for(int i = 1; (1 << i) <= n; ++i)
    {
        maxJ = n - (1 << i) + 1;
        for(int j = 1; j <= maxJ; ++j)
        {
            last = 1 << (i - 1);
            r[i][j] = min(r[i - 1][j], r[i - 1][j + last]);
        }
    }

    int x, y;
    for(int i = 1; i <= m; ++i)
    {
        in >> x >> y;
        int first = y - x + 1;
        int mid = y - (1 << log[first]) + 1;
        out << min(r[ log[first] ][x], r[ log[first] ][mid]) << "\n";
    }

    return 0;
}