#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[100005], dp[20][100005];
int main()
{
    int n, m;
    fin >> n >> m;
    for(int i=1; i<=n; i++)
    {
        fin >> v[i];
        dp[0][i]=v[i];
        //fout << v[i] << " ";
    }
    for(int i=1; (1<<i)<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            if(dp[i-1][j]<dp[i-1][j+(1<<(i-1))] || j+(1<<(i-1))>n)  dp[i][j]=dp[i-1][j];
            else   dp[i][j]=dp[i-1][j+(1<<(i-1))];
            //fout << dp[i][j] << " ";
        }
       // fout << "\n";
    }
    for(int i=1; i<=m; i++)
    {
        int a, b;
        fin >> a >> b;
        int j;
        for(j=1; (1<<j)<=b-a+1; j++);
        j--;
        fout << min(dp[j][a], dp[j][a+(1<<j)-1]) << "\n";
    }

    return 0;
}