#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, nrq, rmq[1001][1001], x, y, lg[200001], logul;
int main()
{
    fin >> n >> nrq;
    for(int i = 1; i <= n; ++ i)
        fin >> rmq[0][i];
    lg[1] = 0;
    for(int i = 2; i <= n; i ++)
        lg[i] = lg[i / 2] + 1;
    for(int i = 1; (1 << i) <= n; ++ i)
        for(int j = 1; j <= n - (1 << i) + 1; ++ j)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
    while(nrq--)
    {
        fin >> x >> y;
        int logul = lg[y - x + 1];
        fout << min(rmq[logul][x], rmq[logul][y - (1 << logul) + 1]) << '\n';
    }
    return 0;
}