#include <bits/stdc++.h>
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

const int N = 1e5 + 5;

int n, m, rmq[18][N];

int main()
{
    f >> n >> m;
    for (int i = 1; i <= n; i++)
        f >> rmq[0][i];
        
    for (int i = 1, p = 2; p <= n; i++, p *= 2){
        for (int j = 1; j <= n - p / 2; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + p / 2]);
    }
    for (; m; m--){
        int x, y; f >> x >> y; if (x > y) swap(x, y);
        int l = y - x + 1;
        int pw = 31 - __builtin_clz(l);
        g << min(rmq[pw][x], rmq[pw][y - (1<<pw) + 1]) << '\n';
    }
    
    return 0;
}