#include <fstream>
#include <vector>
#include <queue>
using namespace std;
using pii = pair<int,int>;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int nmax = 1e5 + 1;
int n , m  , a , b , rmq[20][nmax] , lg[nmax];
signed main()
{
    cin >> n >> m;
    lg[0] = -1;
    for(int i = 1 ; i <= n ; ++i)
    {
        cin >> rmq[0][i];
        lg[i] = lg[i/2] + 1;
    }
    for(int i = 1 ; i <= lg[n] ; ++i)
    {
        for(int j = (1<<i) ; j <= n ; ++j)
        {
            rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j-(1<<(i-1))]);
        }
    }
    for(int i = 1 ; i <= m ; ++i)
    {
        cin >> a >> b;
        int l = b - a + 1;
        cout << min(rmq[lg[l]][b],rmq[lg[l]][a + (1<<lg[l])-1]) << '\n';
    }
    return 0;
}