#include <bits/stdc++.h>

using namespace std;

int dp[30][100000];

int main()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");

    int n, m, a, b;
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        cin>>dp[0][i];

    int logn = log2(n);

    for(int i=1; i<=logn+1; i++)
        for(int j=1; j<=n; j++)
            if(j + (1<<(i-1)) <= n)
                dp[i][j] = min(dp[i-1][j], dp[i-1][j + (1<<(i-1))]);
            else
                dp[i][j] = dp[i-1][j];


    while(m--)
    {
        cin>>a>>b;

        int pwr = log2(b - a + 1);

        cout<<min(dp[pwr][a], dp[pwr][b - (1<<pwr) + 1])<<'\n';
    }


    return 0;
}