#include <bits/stdc++.h>
#define newline '\n'
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
///************************

const int NMAX = 1e5 + 3, LENMAX = log2(NMAX) + 1;
int n, m;
int rmq[NMAX][LENMAX + 3];//rmq[i][j]-ans pe intervalu ce incepe in i si are lungime 2^j
int log2from[NMAX];

void build()
{
    for (int i = 2; i <= NMAX - 3; i++)
        log2from[i] = 1 + log2from[i >> 1];
    for (int j = 1; j <= LENMAX; j++)
        for (int i = 1; i <= n - (1 << j) + 1; i++)
        {
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
        }
}

int query(int x, int y)
{
    int len = y - x + 1;
    int p = log2from[len];
    //cerr << p << endl;
    return min(rmq[x][p], rmq[y - (1 << p) + 1][p]);
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> rmq[i][0];

    build();
    while(m--)
    {
        int x, y;
        fin >> x >> y;
        fout << query(x, y) << newline;
    }//*/
    fout.close();
    return 0;
}