#include <fstream>

using namespace std;

ifstream F("rmq.in");
ofstream G("rmq.out");

int n, m, d[20][100003], lg[100003], ans, x, y;
const int inf = 100003;

int main()
{
    F >> n >> m;
    for(int i = 1; i <= n; ++ i)
        F >> d[0][i];
    lg[1] = 0;
    for(int i = 2; i <= n; ++ i)
        lg[i] = lg[i / 2] + 1;
    d[0][n + 1] = inf;
    for(int i = 1; (1<<i) <= n; ++ i)
    {
        for(int j = 1; j <= n - (1 << i) + 1; ++ j)
            d[i][j] = min(d[i - 1][j], d[i - 1][j + (1 << (i - 1))]);
    }
    for(int i = 0; i < m; ++ i)
    {
        F >> x >> y;
        ans = min(d[lg[y - x+1]][x], d[lg[y - x+1]][y - (1 << lg[y - x + 1]) + 1]);
        G << ans << '\n';
    }
    return 0;
}