#include <iostream>
#include <fstream>
using namespace std;

#define MAXN 23170

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

int n, m;
int a[MAXN];
int dp[MAXN][MAXN];

int main()
{
    f >> n >> m;
    for (int i = 1; i <= n; i++) {
        f >> a[i];
    }

    for (int i = 1; i <= n; i++) {
        dp[i][i] = a[i];
        for (int j = i + 1; j <= n; j++) {
            dp[i][j] = dp[j][i] = min(a[j], dp[i][j - 1]);
        }
    }

    for (int i = 1; i <= m; i++) {
        int x, y;
        f >> x >> y;
        cout << dp[x][y] << endl;
    }

    return 0;
}