#include <stdio.h>
#include <math.h>
 
long int d[18][100000];
 
int main()
{
    long int n,m,x,y,count=0,use=1,min=100000;
    int p[18];
    p[0]=1;
    for(int i=1;i<18;i++)
    {
            p[i]=p[i-1]*2;        
    }
    bool flag=0;
    FILE *fin,*fout;
    fin=fopen("rmq.in","r");
    fout=fopen("rmq.out","w");
    fscanf(fin,"%ld %ld",&n,&m);
    if(n==1)
    {
            fprintf(fout,"%d",1);        
    }
else
{
    for(int i=0;i<n;i++)
    {
            fscanf(fin,"%ld",&d[0][i]);//fscanf(fisier,"%d(ecimal)",&-adresa de citire);
    }
    for(int i=1;i<17;i++)
    {
            for(int j=0;d[i-1][j+p[i-1]]!=0;j++)
            {
                    if(d[i-1][j]<d[i-1][j+p[i-1]])
                    {
                                              d[i][j]=d[i-1][j];
                    }
                    else
                    {
                        d[i][j]=d[i-1][j+p[i-1]];
                    }
            }
    }
    for(long int k=0;k<m;k++)
    {
             flag=0;
             fscanf(fin,"%ld %ld",&x,&y);
             count=0;
             use=1;
             if(x!=y)
             {
             while(use<=y-x)
             {
                            count++;
                            use*=2;
                            flag=1;
             }
             if(flag==1)
             {
                        count--;
             }
             use/=2;
             }
             use=y-x-use+1;
             min=100000;
             for(long int j=x-1;j<=x+use-1;j++)
             {
                      if(min>d[count][j])
                      {
                                         min=d[count][j];
                      }
             }
             fprintf(fout,"%ld",min);
             if(k!=m-1)
             {
                       fprintf(fout,"\n");
             }
    }
}
}