#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int LOG=18;
int n, q, v[100001], a, b, lg[100001];
long long sp[LOG][100001];

void buildSparse()
{
    for (int i=1; i<=n; i++)
    {
        sp[0][i]=v[i];
    }
    for (int k=1; (1<<k)<=n; k++)
    {
        for (int i=1; i+(1<<k)-1<=n; i++)
        {
            sp[k][i]=min(sp[k-1][i], sp[k-1][i+(1<<(k-1))]);
        }
    }
}

int main()
{
    fin>>n>>q;
    for (int i=1; i<=n; i++)
    {
        fin>>v[i];
    }
    lg[1]=0;
    for (int i=2; i<=n; i++)
    {
        lg[i]=lg[i/2]+1;
    }
    buildSparse();
    while(q--)
    {
        fin>>a>>b;
        int k=lg[b-a+1];
        fout<<min(sp[k][a], sp[k][b-(1<<k)+1])<<'\n';
    }

    return 0;
}