#include <fstream>
using namespace std;
int v[100005], dp[20][100005], lg[100005];
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int main() {
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i ++){
        cin >> v[i];
        dp[0][i] = v[i];
    }
    for(int i = 2; i <= n; i ++){
        lg[i] = lg[i / 2] + 1;
    }
    for(int i = 1; i <= n; i ++){
        dp[0][i] = v[i];
    }
    for(int i = 1; (1 << i) <= n; i ++){
        for(int j = 1; j <= n - (1 << i) + 1; j ++){
            int x = 1 << (i - 1);
            dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + x]);
        }
    }
    long a, b;
    for(int i = 1; i <= m; i ++){
        cin >> a >> b;
        long x = lg[b - a + 1];
        long y = (b - a + 1) - (1 << x);
        cout << min(dp[x][a], dp[x][a + y]) << "\n";
    }
    return 0;
}