#include <fstream>

using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
int rmq[100005][30];
int lg[100005];
int main()
{
    int n, m, i, j;
    cin >> n >> m;
    for (i = 1; i <= n; i++)
    {
        cin >> rmq[i][0];
        if (i > 1)
            lg[i] = lg[i / 2] + 1;
    }
    for (j = 1; j <= lg[n]; j++)
        for (i = 1; i + (1 << j) - 1 <= n; i++)
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
    for (i = 1; i <= m; i++)
    {
        int a, b;
        cin >> a >> b;
        if (a > b)
            swap(a, b);
        int lgg = lg[b - a + 1];
        cout << min(rmq[a][lgg], rmq[b - (1 << lgg) + 1][lgg]) << '\n';
    }
    return 0;
}