#include <stdio.h>
#include <algorithm>
using namespace std;

#define Nmax 100005
#define Lgmax 20

int n, m;
int v[Nmax];
int rmq[Nmax][Lgmax];
int lg[Nmax];
int a, b;

void read(){
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &v[i]);
}

void solve(){
    int k, diff, l;

    // Precompute
    for (int i = 2; i <= n; ++i)
       lg[i] = lg[i / 2] + 1;

    for (int i = 1; i <= n; ++i)
        rmq[i][0] = v[i];

    for (int j = 1; 1 << j <= n; ++j)
        for (int i = 1; i + (1 << j) - 1 <= n; ++i){
            l = 1 << (j - 1);
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + l][j - 1]);
        }
    // Queries 
    for (int i = 1; i <= m; ++i){
        scanf("%d %d", &a, &b);
        diff = b - a + 1;
        k = lg[diff];
        printf("%d\n", min(rmq[a][k], rmq[b - (1 << k) + 1][k]));
    }
}

int main(){
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    read();
    solve();
}