#include <bits/stdc++.h>

using namespace std;

int r[17][100003],n,m,lg[100003],p,q;

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

int main()
{
    in >> n >> m;
    for(int j = 0; j < n; j++)
        in >> r[0][j];
    for(int i = 1; (1 << i) <= n; i++)
    {
        for(int j = 0; j + (1 << i) <= n; j++)
        {
            r[i][j] = min(r[i - 1][j], r[i - 1][j + (1 << (i - 1))]);
        }
    }
    lg[1] = 0;
    for(int i = 2; i <= n; i++)
    {
        lg[i] = 1 + lg[i / 2];
    }
    for(int i = 1;i <= m; i++){

        in >> p >> q;

        p--;

        q--;

        int l = lg[q - p + 1];

        out << min(r[l][p],r[l][q - (1 << l) + 1]) << "\n";

    }
    return 0;
}