#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, rmq[100001][17];
int lg;
int main()
{
    fin >> n >> m;
    lg=log2(n);
    for (int i = 0; i < n; i++)
    {
        fin >> rmq[i][0];
    }
    for (int i = 1; i <= lg; i++)
        for (int j = 0; j+(1<<i)-1<n;j++)
            rmq[j][i] = min(rmq[j][i-1], rmq[j+(1<<(i-1))][i-1]);
    for (int i = 0; i < m; i++)
    {
        int x, y;
        fin >> x >> y;
        int t = log2(y-x+1); ///pana cand imi dau seama ce fac
        fout << min(rmq[x-1][t], rmq[y-(1<<t)][t]) << '\n';
    }
    return 0;
}