#include <bits/stdc++.h>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int MAXN = 100000;
const int LOG = 17;

int n, m;
int a[MAXN+1];
int st[MAXN+1][LOG+1];
int lg2[MAXN+1];

int main() {
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        fin >> a[i];
        st[i][0] = a[i];
    }
    lg2[1] = 0;
    for (int i = 2; i <= n; i++)
        lg2[i] = lg2[i/2] + 1;

    for (int j = 1; j <= LOG; j++) {
        for (int i = 1; i+(1<<j)-1 <= n; i++) {
            st[i][j] = min(st[i][j-1], st[i + (1 << (j-1))][j-1]);
        }
    }
    while (m--) {
        int x, y;
        fin >> x >> y;
        if (x > y) swap(x, y);
        int len = y-x+1;
        int k = lg2[len];
        int ans = min(st[x][k], st[y - (1 << k)+1][k]);
        fout << ans << '\n';
    }
    return 0;
}