#include <fstream>

using namespace std;

ifstream cin ("rmq.in");
ofstream cout ("rmq.out");

#define N 100000
#define LOG 36

int a[N], sp[N][LOG], lg[N];

void rmq(int n)
{
    int k,i,l,c;
    for (i=0; i<n; i++)
        sp[i][0]=a[i];
    k=lg[n];
    for (c=1; c<=k; c++)
        for (l=0; l+(1<<c)<=n; l++)
            sp[l][c]=min(sp[l][c-1], sp[l+(1<<(c-1))][c-1]);
}

int query(int l, int c)
{
    int lung,k;
    lung=c-l+1;
    k=lg[c-l+1];
    return min(sp[l][k], sp[c-(1<<k)+1][k]);
}

int main()
{
    int n,m,i,q1,q2;
    cin >> n >> m;
    for (i=0; i<n; i++)
        cin >> a[i];
    for (i=2; i<=N; i++)
        lg[i]=lg[i/2]+1;
    rmq(n);
    for (i=0; i<m; i++){
        cin >> q1 >> q2;
        cout << query(q1-1, q2-1) << '\n';
    }
    return 0;
}