#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int nmax = 100000;

int n, m, lg[nmax + 5], rmq[30][nmax + 5];


void RMQ()
{
    for(int i = 2; i <= nmax; ++i)
        lg[i] = 1 + lg[i >> 1];
    for(int i = 1; i <= lg[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))]);
    }
}
int query(int x, int y)
{
    int p = lg[y - x + 1];
    return min(rmq[p][x], rmq[p][y - (1 << p) + 1]);
}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
        fin >> rmq[0][i];
    RMQ();
    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        fout << query(x, y) << "\n";
    }
    return 0;
}