#include <fstream>
using namespace std;

ifstream cin ("rmq.in");
ofstream cout ("rmq.out");

const int NMAX = 1e5+5, LOGMAX = 18;
int logs[NMAX], rmq[LOGMAX][NMAX];

int main()
{
    int n, m;
    cin.tie(0);
    cin >> n >> m;

    logs[1] = 0;
    for(int i = 2; i < NMAX; i++)
        logs[i] = logs[i >> 1] + 1;

    for(int i = 1; i <= n; i++)
        cin >> rmq[0][i];

    for(int i = 1; (1 << i) <= n; i++)
        for(int j = 1; j <= n - (1 << i) + 1; j++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1 << (i-1))]);

    for(int i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        int diff = b - a + 1;
        int log = logs[diff];
        cout << min( rmq[log][a], rmq[log][a + diff - (1 << log)]) << '\n';
    }
    cout.flush();
    return 0;
}