#include <bits/stdc++.h>
#define nmax 100003

using namespace std;

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

int rmq[20][nmax];
int p[nmax], n, m;
void Puteri(int x)
{
    p[1] = 0;
    for(int i = 2; i <= x; i++)
        p[i] = 1 + p[i / 2];
}
void Citire()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
        fin >> rmq[0][i];
}

void RMQ()
{
    int i, j, L;
    L = p[n];

    for(i = 1; i <= L; i++)
        for(j = 1; j <= n - (1 << i) + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j],
                            rmq[i - 1][j + (1 << (i - 1))]);
}
int main()
{
    Citire();
    Puteri(n);
    RMQ();

    int x, y, len;
    while(m--)
    {
        fin >> x >> y;
        len = p[y - x + 1];
        fout << min(rmq[len][x], rmq[len][y - (1<<len) + 1]) << "\n";
    }
    return 0;
}