#include <bits/stdc++.h>

using namespace std;

int n, test, v[100005], rmq[18][100005], lg2[100005];

void build_rmq()
{
    lg2[1] = 0;
    for (int i = 2; i <= n; ++i)
        lg2[i] = lg2[i/2]+1;
    for (int i = 0; i < 18; ++i)
        for (int j = 0; j < 100005; ++j)
            rmq[i][j] = 2000000000;
    rmq[0][n] = v[n];
    for (int i = 1; i < n; ++i)
        rmq[0][i] = min(v[i], v[i+1]);
    for (int i = 1; i < 18; ++i){
        int lg = 1<<i;
        for (int j = 1; j+lg <= n; ++j)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+lg/2]);
    }
}

int query(int a, int b)
{
    int lg = lg2[b-a];
    return min(rmq[lg][a], rmq[lg][b-(1<<lg)]);
}

int main()
{
    ifstream fin ("rmq.in");
    ofstream fout ("rmq.out");
    fin >> n >> test;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];
    build_rmq();
    while(test--){
        int x, y;
        fin >> x >> y;
        fout << query(x, y) << "\n";
    }
    return 0;
}