#include <bits/stdc++.h>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");
int RMQ[20][100005];



int main()
{
    int n, m;
    int x, y, k;
    fin >> n >> m;

    for(int i = 1; i <= n; i++)
        fin >> RMQ[0][i];

    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))]);


    for(int i = 0; i < m; i++)
    {
        fin >> x >> y;

        k = log2(y - x + 1);

        fout << min(RMQ[k][x], RMQ[k][y - (1 << k) + 1]) << '\n';
    }
}