#include <stdio.h>
#include <algorithm>
long a[100005],n,m,i,j,x,y;
using namespace std;
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%ld %ld\n",&n,&m);
    for (i=1;i<n+1;++i)
    scanf("%ld\n",&a[i]);
    for (i=1;i<m+1;++i){
        scanf("%ld %ld\n",&x,&y);
        printf("%ld\n",*min_element(a+x,a+y+1));
        }
        
    return 0;
}