#include <bits/stdc++.h>

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

int P[100002];
int n, m;
int rmq[17][100002];
/// rmq[i][j] = val minima din a[j...j + 2 ^ i - 1]
void prec(int n)
{
    int i;
    P[1] = 0;
    for(i = 2;i <= n;i++)
        P[i] = 1 + P[i / 2];
}
int main()
{
    int i, j;
    fin >> n >> m;
    prec(n);
    for(i = 1;i <= n;i++)
        fin >> rmq[0][i];
    for(i = 1;i <= P[n];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))]);
    while(m--)
    {
        int x, y;
        fin >> x >> y;
        i = P[y - x + 1];
        fout << min(rmq[i][x], rmq[i][y - (1 << i) + 1]) << "\n";
    }
    return 0;
}