#include <algorithm>
#include <cstdio>
using namespace std;
int a[100005],n,m,dp[1005][1005];
int main(){
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int i,j,x,y;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
     scanf("%d",&a[i]);
     dp[1][1] = a[1];
    for(i = 1; i <= n; i++)
    {
        dp[i][i] = a[i];
        for(j = i+1; j <= n; j++)
          dp[i][j] = min(a[j], dp[i][j-1]);

    }
    for(i = 1; i <= m; i++)
    {
        scanf("%d%d",&x,&y);
        printf("%d\n",dp[x][y]);
    }
    return 0;
}