#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <iomanip>
#include <bitset>
#include <cstdio>

using namespace std;

const int N = (int) 1e5 + 7;
const int K = 20;
int n;
int m;
int t[K][N], lg[N];

int main() {
    freopen ("rmq.in", "r", stdin);
    freopen ("rmq.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    for (int i = 2; i <= n; i++) lg[i] = 1 + lg[i / 2];
    for (int k = 1; k < K; k++) {
        for (int i = 1; i + (1 << k) - 1 <= n; i++) {
            t[k][i] = min(t[k - 1][i], t[k - 1][i + (1 << (k - 1))]);
        }
    }
    for (int i = 1; i <= m; i++) {
        int l, r;
        scanf("%d %d", &l, &r);
        int k = lg[r - l + 1];
        int x = min(t[k][l], t[k][r - (1 << k) + 1]);
        printf("%d\n", x);
    }
}