#include <fstream>
#define nmax 100001
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m;
int rmq[20][nmax];
int LG[nmax];
int main()
{
    f >> n >> m;
    for(int i = 1; i <= n; i++)
        f >> rmq[0][i];
    for(int i = 1; (1<<i) <= n; i++)
        for(int j = 1; j <= n - (1<<(i-1)) + 1; j++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i - 1][j + (1<<(i-1))]);
    for(int i = 2; i <= n; i++)
        LG[i] = LG[i / 2] + 1;
    for(int i = 1; i <= m; i++)
    {
        int a, b;
        f >> a >> b;
        int k = LG[b - a + 1];
        g << min(rmq[k][a], rmq[k][b - (1<<k) + 1]) << '\n';
    }
    return 0;
}