#include <iostream>
#include <fstream>

using namespace std;

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

int log[1000005];
int dp[1000005][30];
int v[1000005];

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

    log[0] = log[1] = 0;
    for(int i = 2;i <= n; ++i)
        log[i] = log[i / 2] + 1;

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

    for(int i = 1;i <= n; ++i)
        dp[i][0] = min(v[i] , v[i + 1]);

    for(int i = 1;i <= n; ++i)
        for(int j = 1; j<= log[n]; ++j)
        dp[i][j] = min(dp[i][j - 1], dp[i + (1 << log[j - 1])][j - 1]);

    for(int i = 1;i <= m; ++i)
        {
            int a, b, l;
            fin >> a >> b;
            l = b - a;
            fout << min(dp[a][log[l]], dp[b - (1 << log[l])][log[l]]) << "\n";
        }

    return 0;
}