#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int dp[20][100010],n,lg[100010],q;
int main()
{
    in>>n>>q;
    for(int i=1;i<=n;i++)
    {
        in>>dp[0][i];
        if(i>=2)
            lg[i]=lg[i/2]+1;
    }
    for(int i=1;(1<<i)<=n;i++)
    for(int j=1;j<=n-(1<<(i-1));j++)
        dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
    for(;q;q--)
    {
        int x,y;
        in>>x>>y;
        int diff=y-x+1;
        out<<min(dp[lg[diff]][x],dp[lg[diff]][y-(1<<lg[diff])+1])<<'\n';
    }

    return 0;
}