#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m;
int v[100004];
int dp[100004][20];

int main()
{
    fin>>n>>m;

    for(int i=1; i<=n; i++){
        fin>>v[i];
        dp[i][0] = v[i];
    }

    for(int j=1; (1<<j)<=n; j++)
    {
        for(int i=1; i<=n-(1<<(j-1)); i++)
        {
                dp[i][j] = min(dp[i][j-1], dp[i+(1<<(j-1))][j-1]);
        }
    }
    int x, y;
    for(int i=0; i<m; i++)
    {
        fin>>x>>y;
        int j=0;
        while(x+(1<<j)-1<=y)
            j++;
        j--;
        fout<<min(dp[x][j], dp[y-(1<<j)+1][j])<<'\n';
    }
    return 0;
}