#include <fstream>
#include <cmath>
using namespace std;
fstream cin("afisminime.in",ios::in),cout("afisminime.out",ios::out);
int n,a[100001],st[100001][18],lg[100001];
int rmq(int l,int r)
{
    int j = log(r-l+1);
    return min(a[st[l][j]],a[st[r-(1<<j)+1][j]]);
}
int main()
{
    int k;
    cin>>n>>k;
    for(int i=1; i<=n; i++)
    {
        cin>>a[i];
    }


    for(int i=1; i<=n; i++)
    {
        st[i][0]=i;
    }

    for (int j = 1; (1<<j) <= n; j++)
        for (int i = 1; i + (1 << j)-1 <= n; i++)
        {
            if(a[st[i][j-   1]] < a[st[i+(1<<(j-1))][j-1]])
            {
                st[i][j] = st[i][j-1];
            }
            else
            {
                st[i][j] = st[i+(1<<(j-1))][j-1];
            }
        }
    for(;k;k--){
        int x,y;
        cin>>x>>y;
        cout<<rmq(x,y)<<'\n';
    }
    return 0;
}