#include <fstream>

#define NMAX 100005
using namespace std;

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

int dp[NMAX][30], put2[NMAX];

int main()
{
    int n, m;
    fin >> n >> m;

    for(int i = 2; i <= NMAX; ++i)
        put2[i] = put2[i / 2] + 1;
    for(int i = 1; i <= n; ++i)
    {
        int x;
        fin >> x;

        dp[i][0] = x;
    }

    for(int put = 1; put <= put2[n]; ++put){
        int limit = (1 << put);
        for(int i = 1; i <= n - limit + 1; ++i)
            dp[i][put] = min(dp[i][put - 1], dp[i + (1 << (put - 1))][put - 1]);
    }
    for(int i = 1; i <= m; ++i){
        int st, dr;
        fin >> st >> dr;

        int lg = dr - st + 1;
        fout << min(dp[st][put2[lg]], dp[st + lg - put2[lg] - 1][put2[lg]]) << '\n';
    }
    return 0;
}