#include <fstream>

using namespace std;

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

int rmq[17][100001], lg[100001], v[100001];
int n, m;

int main()
{
    in>>n>>m;

    for(int i = 1; i <= n; i++)
        in >> v[i];
    for(int i = 1; i <= n; i++)
        rmq[0][i] = v[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+(1<<i)-1<=n; j++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1 << (i-1))]);

    for (int i = 0; i < m; i++)
    {
        int L, R;
        in >> L >> R;
        int length = R - L + 1;
        int log = lg[length];
        int s = length - (1<<log);
        out << min(rmq[log][L], rmq[log][L + s])<<'\n';
    }



    return 0;
}