#include<bits/stdc++.h>
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int dp[101][101],n,x,y,t;


int main()
{
    f>>n>>t;
    for(int i=1;i<=n;++i)
    {
        f>>dp[0][i];
    }
    int ceva =log2(n);
    int nr=1;
    for(int i=1;i<=ceva;++i)
    {
        for(int j=1;j<=n-nr;++j)
        {
            dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
        }
        nr+=(1<<i);
    }
    while(t--)
    {
        f>>x>>y;
        int d=y-x+1;
        int ld=log2(d);
        g<<min(dp[ld][x],dp[ld][y-(1<<ld)+1])<<'\n';
    }

    return 0;
}