#include <fstream>
#define inf 2000000000
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,x,y;
int dp[20][100001];///minimul secv ce incepe din j, are lungimea 2^i
int log2[100001];
int main()
{
    fin>>n>>m;
    for(int i=2;i<=n;i++)
        log2[i]=log2[i/2]+1;

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

    for(int i=1;i<=log2[n];i++)
        for(int j=1;j<=n-(1<<i)+1;j++)
            dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        int sol=inf;
        int d=y-x+1,k=log2[d];
        sol=min(dp[k][x],dp[k][y-(1<<k)+1]);
        fout<<sol<<'\n';
    }
}