#include <fstream>
#include <vector>

using namespace std;

#define MAXN 100005
#define LMAX 18

int rmq[LMAX][MAXN];
int n, m;
int lg[MAXN];
int v[MAXN];

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

int main()
{
    cin >> n >> m;

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

    lg[1] = 0;

    for(int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] +1;

    int k;

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

    int x, y, diff, sh;

    for (int i = 0; i < m; i++)
    {
        cin >> x >> y;

        diff = y - x + 1;
        k = lg[diff];
        sh = diff - (1 << k);
        cout << min(rmq[k][x] ,rmq[k][x + sh]) << "\n";
    }
    return 0;
}