#include <bits/stdc++.h>
#define N_MAX 100005

using namespace std;

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

int N, M, v[N_MAX];

int lg[N_MAX];
int RMQ[20][N_MAX];

int Query(int le, int ri)
{
    int len = ri - le + 1;
    return min(RMQ[lg[len]][le], RMQ[lg[len]][ri - (1 << lg[len]) + 1]);
}

int main()
{
    fin >> N >> M;
    for (int i = 1; i <= N; i++)
    {
        fin >> v[i];
        RMQ[0][i] = v[i];
    }

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

    for (int i = 1; i <= lg[N]; i++)
    {
        RMQ[i][N + 1] = INT_MAX;
        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 = 1; i <= M; i++)
    {
        int a, b;
        fin >> a >> b;
        fout << Query(a, b) << "\n";
    }
    return 0;
}