#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int N=100009,LOGN=log2(100009)+1;
int n,k;
int a[N],dp[N][LOGN];
void solve()
{
    for(int i=1;i<=n;i++)
        dp[i][0]=a[i];
    for(int j=1;j<=log2(n);j++)
        for(int i=1;i<=n&&i+(1<<j)<=n+1;i++)
            dp[i][j]=min(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
    while(k)
    {
        int x,y;
        k--;
        fin>>x>>y;
        int put=log2(y-x+1),ans=min(dp[x][put],dp[y-(1<<put)+1][put]);
        fout<<ans<<'\n';
    }
}
int main()
{
    fin>>n>>k;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    solve();
    return 0;
}