#include <bits/stdc++.h>

using namespace std;

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

int n, m;
int rmq[17][100005];
int P[100005];

void Power()
{
    P[1] = 0;
    for(int i = 2;i <= n;i++)
        P[i] = P[i / 2] + 1;
}
int main()
{
    int i, j, x, y;
    fin >> n >> m;
    for(i = 1;i <= n;i++)
        fin >> rmq[0][i];
    Power();
    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))]);
    for(i = 1;i <= m;i++)
    {
        fin >> x >> y;
        int po = P[y - x + 1];
        fout << min(rmq[po][x], rmq[po][y - (1 << po) + 1]) << "\n";
    }
    return 0;
}