#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int nmax = 100005;
int N,M,rmq[19][nmax];
int lg[nmax];

inline void Build()
{
    int i,j;
    for(i = 2; i <= nmax - 5; i++) lg[i] = 1 + lg[i>>1];
    for(i = 1; i <= 17; i++)
    {
        for(j = 1; j <= N - (1 << i) + 1; j++)
        {
            rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j + (1 << (i-1))]);
        }
    }
}

inline int Query(int x, int y)
{
    int p;
    p = lg[y - x + 1];
    return min(rmq[p][x],rmq[p][y - (1 << p) + 1]);
}


int main()
{
    int i,x,y;
    fin >> N >> M;
    for(i = 1; i <= N; i++) fin >> rmq[0][i];
    Build();
    while(M--)
    {
        fin >> x >> y;
        fout << Query(x,y) << "\n";
    }
    fout.close();
    return 0;
}