#include <stdio.h>
#include <algorithm>
using namespace std;

#define LMAX 18
#define NMAX 100001

int v[NMAX], lg[NMAX];
int rmq[LMAX][NMAX];

int main()
{
    FILE *fin, *fout;

    fin = fopen("rmq.in", "r");
    fout = fopen("rmq.out", "w");

    int n, m;

    fscanf(fin, "%d %d", &n, &m);

    for(int i = 1; i <= n; i++)
        fscanf(fin, "%d", &rmq[0][i]);

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

    ///precalculare

    for(int i = 1; i <= LMAX; 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))]);

    for(int i = 1; i <= m; i++)
    {
        int x, y;
        fscanf(fin, "%d%d", &x, &y);
        int d = y - x + 1;
        int p = lg[d];
        int val = d - (1 << p);
        fprintf(fout, "%d\n", min(rmq[p][x], rmq[p][x + val]));
    }

    return 0;
}