#include <iostream>
#include <fstream>

#define nmax 100001

using namespace std;

int n, m;
int x, y;
int RMQ[18][nmax]; // 100000 = 2^16.6 <=> 2^17, am nevoie si de pozitia 0 asa ca voi volosi 18 pozitii
int Exp[nmax];

int main()
{
    
    ifstream fi("rmq.in");
    ofstream fo("rmq.out");
    
    fi >> n >> m;
    
    for (int i = 1; i <= n; i++)
        fi >> RMQ[0][i];
    
    // Exp[i] - cea mai mare valoare a.i. 2^Exp[i] <= i
    for (int i = 2; i <= n; i++)
        Exp[i] = 1 + Exp[i/2];

    // preprocess
    for (int i = 1; i <= Exp[n]; i++)
        for (int j = 1; j <= n; j++)
        {
            int st = j;
            int dr = st + (1<<i) - 1;
            int mid = dr - (1<<(i-1)) + 1;

            RMQ[i][j] = min(RMQ[i-1][st], RMQ[i-1][mid]);
        }
    
    for (int i = 1; i <= m; i++)
    {
        
        fi >> x >> y;
        
        int l = (y - x + 1); // lungimea intervalului
        int p = Exp[l]; // cea mai mare valoare a.i. 2^p <= l
        
        int rez = min(RMQ[p][x], RMQ[p][y - (1<<p) + 1]);
        
        fo << rez << "\n";
        
    }
    
    
    fi.close();
    fo.close();
    
    return 0;
}