#include <iostream>
#include <fstream>
using namespace std;

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

int n, m, x, v[100004];
int dp[100004][100];
int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        fin>>x;
        v[i]=x;
    }
    for(int i=n; i>0; i--)
    {
        dp[i][0] = v[i];
        for(int j=1; (1<<j)<=n; j++)
        {
            if(i+(1<<(j-1))<=n)
                dp[i][j] = min(dp[i][j-1], dp[i+(1<<(j-1))][j-1]);
            else
                dp[i][j] = dp[i][j-1];
        }
    }
    int y, z=0;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        while(1<<z + x < y)
            z++;
        if(1<<z + x -1 == y)
            fout<<dp[x][z]<<'\n';
        else
            fout<<min(dp[x][z], dp[y-(1<<z)+1][z])<<'\n';
    }
    return 0;
}