#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int maxn = 100005;
const int maxlg = 18;
int rmq[maxn][maxlg];    /// rmq[i][j] = minimul din intervalul i... i + 2^j
int lg[maxn];
int v[maxn];
int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    for(int i = 1; i <= n; i++)
        rmq[i][0] = v[i];
    for(int i = 2; i < maxn; i++)
        lg[i] = lg[i / 2] + 1;
    for(int j = 1; j <= lg[n]; j++)
    {
        for(int i = 1; i <= n; i++)
        {
            int dist = (1 << j);
            if(i + dist / 2 > n)
                continue;
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + dist / 2][j - 1]);
        }
    }
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        int p = lg[y - x + 1];
        int rez = min(rmq[x][p], rmq[y - (1 << p) + 1][p]);
        out << rez << '\n';
    }
    return 0;
}