#include <fstream>
using namespace std;

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

const int Nmax = 1e5 + 5, Lmax = 20;

int v[Nmax], lg[Nmax], rmq[Nmax][Lmax];
int n;

void RMQ()
{
    int i, j, k = lg[n];
    for(i = 0; i < n; i ++)
        rmq[i][0] = v[i];

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

int query(int i, int j)
{
    int len = j - i + 1;
    int k = lg[len];
    return min(rmq[i][k], rmq[i + len - (1 << k)][k]);
}
int main()
{
    int i, a, b, m;
    cin >> n >> m;
    for(i = 0; i < n; i ++)
        cin >> v[i];
    for(i = 2; i <= n; i ++)
        lg[i] = 1 + lg[i / 2];
    RMQ();
    for(i = 1; i <= m; i ++)
    {
        cin >> a >> b;
        cout << query(a - 1, b - 1) << '\n';
    }
    return 0;
}