#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int maxn = 100005;
int vp[maxn];
int dp[18][maxn];
int main()
{
    int n, k;
    in >> n >> k;
    for(int i = 2; i < maxn; i++)
        vp[i] = vp[i / 2] + 1;
    for(int i = 1; i <= n; i++)
    {
        int x;
        in >> x;
        dp[0][i] = x;
    }
    for(int i = 1; i <= vp[n]; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            int p = (1 << (i - 1));
            if(j + p <= n)
                dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + p]);
            else
                dp[i][j] = dp[i - 1][j];
        }
    }
    for(int i = 1; i <= k; i++)
    {
        int x, y;
        in >> x >> y;
        int dif = y - x + 1;
        int lgdif = vp[dif];
        out << min(dp[lgdif][x], dp[lgdif][y - (1 << lgdif) + 1]) << "\n";
    }
    return 0;
}