#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,q,v[100005],d[100005][25];
int main()
{
    fin>>n>>q;
    for (int i=1;i<=n;i++)
    {
        fin>>v[i];
        d[i][0]=v[i];
    }
    for (int j=1;(1<<j)<=n;j++)
        for (int i=1;i+(1<<j)-1<=n;i++)
            d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);

    for (;q;--q)
    {
        int x,y;
        fin>>x>>y;
        int p=log2(y-x+1);
        int mn=min(d[x][p],d[y-(1<<p)+1][p]);
        fout<<mn<<'\n';
    }

    return 0;
}