#include <bits/stdc++.h>

const int N = 1e5 + 1;

int rmq[17][N];
int v[N];
int lg[N];

using namespace std;

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

int main()
{
    int n, m, p, x, y;
    fin >> n >> m;
    for (int i = 2; i < N; i++)
        lg[i] = lg[i/2] + 1;
    for (int i = 1; i <= n; i++)
        fin >> rmq[0][i];
    for (int i = 1; i <= lg[n]; i++)
        for (int j = 1; j <= n; j++)
            rmq[i][j] = min( rmq[i-1][j], rmq[i-1][j-(1<<(i-1))] );
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        p = lg[y-x+1];
        fout << min( rmq[p][y], rmq[p][x+(1<<p)-1] ) << "\n";
    }
    return 0;
}