#include <bits/stdc++.h>
using namespace std;
const int MAX = 100000;
int v[MAX+1], mat[MAX+1][17];
int main()
{
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    int n, m;
    fin>>n>>m;
    for(int i=1; i<=n; ++i)
    {
        fin>>v[i];
        mat[i][0]=v[i];
    }
    for(int p=1; (1<<p)<=n; ++p) 
        for(int i=1; i+(1<<p)-1<=n; ++i)
            mat[i][p] = min(mat[i][p-1], mat[i + (1<<(p-1))][p-1]);
    for(int i=1; i<=m; ++i)
    {
        int st, dr;
        fin>>st>>dr;
        int len=dr-st+1;
        int p=log2(len);
        int res = min(mat[st][p], mat[dr-(1<<p)+1][p]);
        fout<<res<<'\n';
    }
    return 0;
}