#include <bits/stdc++.h>
#define INF 0x3f3f3f3f  // INF mare pentru long long
#define mod 666013
#define N 100001
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

vector<int>tree(4*N);
vector<int>a(N);
void build(vector<int>&a, int v, int tl, int tr){
    if(tl==tr)
        tree[v]=a[tl];
    else{
        int tm=(tl+tr)/2;
        build(a,v*2,tl,tm);
        build(a,v*2+1,tm+1,tr);
        tree[v]=min(tree[2*v],tree[2*v+1]);
    }
}

int sum(int v, int tl, int tr, int x, int y,vector<int>&t){
    if (x > tr || y < tl) return INF;
    if (x <= tl && y >= tr) return t[v];
    int tm = (tl+tr)/2;
    return min(sum(2*v, tl, tm, x, min(y,tm),t) ,
        sum(2*v+1,tm+1,tr,max(x,tm+1),y,t));

}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n,m;
    f>>n>>m;
    for(int i=1; i<=n; ++i)
        f>>a[i];
    build(a,1,1,n);

    int a,b;

    for(int i=1; i<=m; ++i){
        f>>a>>b;
        g<<sum(1,1,n,a,b,tree)<<'\n';
    }



    return 0;
}