#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;

int n,m,x,y;
int dp[20][100005];

int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);

    scanf("%d%d", &n,&m);
    for(int i=0;i<n;++i)
        scanf("%d", &dp[0][i]);

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

    for(int i=0;i<m;++i){
        scanf("%d%d", &x,&y);
        --x, --y;
        int k =log2(y-x+1);
        cout<<min(dp[k][x], dp[k][y-(1<<k)+1])<<"\n";
    }

    return 0;
}