#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int maxn = 100005;
int putere[maxn];
int dp[18][maxn];
int v[maxn];


int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        in >> v[i];
        dp[0][i] = v[i];
    }
    for(int i = 2; i < maxn; i++)
        putere[i] = putere[i / 2] + 1;
    int lim = putere[n];
    for(int k = 1; k <= lim; k++)
    {
        for(int i = 1; i <= n; i++)
        {
            dp[k][i] = dp[k - 1][i];
            if(i + (1 << (k - 1) <= n))
                dp[k][i] = min(dp[k][i], dp[k - 1][i + (1 << (k - 1))]);
        }
    }
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        int k = putere[y - x + 1];
        out << min(dp[k][x], dp[k][y - (1 << k) + 1]) << "\n";
    }
    return 0;
}