#include <bits/stdc++.h>
using namespace std;
#define MAX 100005
 
int sp[MAX][MAX];
int lg[MAX];
int arr[MAX];
void buildSparseTable(int arr[], int n)
{
    for (int i = 0; i < n; i++)
        sp[i][0] = arr[i];
 
    int k = lg[n];
    for (int j = 1; j <= k; j++) {
        for (int i = 0; (i + (1<<j)) <= n; i++) {
            sp[i][j] = min(sp[i][j - 1], sp[i + (1<<(j-1)) ][j-1]);
        }
    }
}
 
int query(int i, int j)
{
    int len = j-i+1;
    int k = lg[j - i + 1];
 
    return min(sp[i][k], sp[i+len-(1<<k)][k]);
}
 
int main()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
   int nr,q,p,b;
   cin>>nr>>q;
   for(int i=0;i<nr;i++)
   {
       cin>>arr[i];
   }
    for(int i=2; i<=MAX; i++)
        lg[i] = 1 + lg[i/2];
 
    buildSparseTable(arr, nr);
    
    int k = lg[nr];
        
    for(int i=1;i<=q;i++)
    {
        cin>>p>>b;
        cout<<query(p-1,b-1)<<endl;
    }
    return 0;
}