#include <bits/stdc++.h>

using namespace std;

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

int n, m, l;
int rmq[100001][19], v[100001], lg[100001];

int main()
{
    in >> n >> m;
    for (int i = 1; i <= n; ++i)
        in >> v[i];
    for (int i = 2; i <= n; ++i)
        lg[i] = lg[i / 2] + 1;
    for (int i = 1; i <= n; ++i)
        rmq[i][0] = v[i];
    for (int j = 1; (1 << j) <= n; ++j)
    {
        for (int i = 1; i <= n - (1 << j) + 1; ++i)
        {
           l = 1 << (j - 1);
           rmq[i][j] = min(rmq[i][j - 1], rmq[i + l][j - 1]);
        }
    }
    int x, y, diff, salt;
    for (int i = 1; i <= m; ++i)
    {
        in >> x >> y;
        diff = y - x + 1;
        l = lg[diff];
        salt = diff - (1 << l);
        out << min(rmq[x][l], rmq[x + salt][l]) << '\n';
    }
    return 0;
}