#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int v[100001];
int a[100001][17];

int query(int l, int r) {
    int len = r - l + 1;
    int k = 0;
    while( 1 << (k+1) <= len) k++;
    return min(a[l][k], a[r-(1<<k)+1][k]);
}

int main()
{
    int n, q, log = 17;
    cin >> n >> q;
    for(int i = 1; i <= n; ++i) {
        cin >>v[i];
        a[i][0] = v[i];
    }
    for(int j = 1; j < log; ++j) {
        for(int i = 1; i + (1 << j) - 1 <= n; ++i){
                a[i][j] = min(a[i][j - 1], a[i+(1<<(j-1))][j-1]);
        }
    }
    for (int i = 1; i <= q; ++i) {
        int l, r;
        cin >> l >> r;
        cout << query(l, r) << " ";
    }
    return 0;
}