#include <bits/stdc++.h>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m, x, y, p2[100005];
int rmq[20][100005];

void Rmq()
{
//    p2[1] = 0
//    p2[2] = 1
//    p2[3] = 1
//    p2[4] = 2
//    p2[5] = 2
//    p2[6] = 2
//    p2[7] = 2
//    p2[8] = 3
//    p2[1] = 0;
    for(int i = 2; i <= n; i++)
        p2[i] = p2[i/2] + 1;
    for(int i = 1; (1 << i) <= n; i++)
        for(int j = 1; j <= n - (1 << (i-1)); j++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1 << (i-1))]);
}


int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
        fin >> rmq[0][i];
    Rmq();
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        int p = p2[y - x + 1];
        fout << min(rmq[p][x], rmq[p][y - (1 << p) + 1]) << "\n";
    }
    return 0;
}