#include <bits/stdc++.h>

using namespace std;

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

int rmq[20][200005];
int lg2[200005];

int main()
{
    fin.tie(0); fin.sync_with_stdio(false);
    int n, m; fin>>n>>m;
    for (int i=2; i<=n; i++) {
        lg2[i]=lg2[i/2]+1;
    }

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

    for (int i=1; i<=lg2[n]; i++) {
        for (int j=1; j<=n-(1<<i)+1; j++) {
            rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
        }
    }
    int x, y;
    for (int i=1; i<=m; i++) {
        fin>>x>>y;
        int line = lg2[x-y+1];
        int ans = min(rmq[line][x], rmq[line][y-(1<<line)+1]);
        fout<<ans<<'\n';
    }
    return 0;
}