//package rmq;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;

public class Main {

	public static void main(String[] args) throws IOException {
		
		  BufferedReader br = new BufferedReader(new FileReader("rmq.in"));
	      String line = br.readLine();
	      int n,m;
	      n = Integer.valueOf(line.split(" ")[0]);
	      m = Integer.valueOf(line.split(" ")[1]);
	      int[] a = new int[n+1];
	      int[][] d = new int[n+1][20];
	      int[] lg = new int[n+1];
	      for (int i = 1; i <= n; i++) {
	          line = br.readLine();
	          a[i] = Integer.valueOf(line);
	      }
	   
	      lg[1]=0;
	      for (int i=2;i<=n;i++)
	          lg[i]=lg[i/2]+1;
	   
	      for (int i=1;i<=n;i++)
	          d[0][i]=a[i];
	   
	      for (int i=1; (1 << i) <=n;i++)
	          for (int j=1;j <= n - (1 << i)+1;j++)
	          {
	        	  int l=1<<(i-1);
	        	  d[i][j]= Math.min( d[i-1][j] , d[i-1][j+l] );
	          }
	      int x,y,diferenta,log,shifted;
	      PrintWriter printer = new PrintWriter("rmq.out");
	      for (int i = 0; i < m; i++) {
	          line = br.readLine();
	          x = Integer.valueOf(line.split(" ")[0]);
	          y = Integer.valueOf(line.split(" ")[1]);
	          diferenta=y-x+1;
	          log=lg[diferenta];
	          shifted=diferenta - (1<<log);
	          printer.printf("%d\n",Math.min(d[log][x],d[log][x+shifted]) );
	      }
	      printer.close();
	      br.close();
	}

}
/*
 * #include <stdio.h>
#include <vector>
 
using namespace std;
 
#define NMAX 100002
#define LMAX 18
 
long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];
 
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
 
    long int i,j,l;
 
    scanf("%ld %ld",&n,&m);
 
    for (i=1;i<=n;i++)
        scanf("%ld ",&a[i]);
 
    lg[1]=0;
    for (i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
 
    for (i=1;i<=n;i++)
        rmq[0][i]=a[i];
 
    for (i=1; (1 << i) <=n;i++)
        for (j=1;j <= n - (1 << i)+1;j++)
        {
        l=1<<(i-1);
        rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+l] );
        }
 
    long int x,y,diff,sh;
     
    for (i=1;i<=m;i++)
    {
        scanf("%ld %ld",&x,&y);
         
        diff=y-x+1;
        l=lg[diff];
        sh=diff - (1<<l);
        printf("%ld\n",min(rmq[l][x],rmq[l][x+sh]) );
    }   
    return 0;
}
 */