#include <bits/stdc++.h>

using namespace std;

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

int n,m;
int rmq[18][100002];
int lg[100002];
/// elementul minim din intervalul de lungime 2^i care incepe cu j

/// rmq [i][j] = min(rmq[i-1][j],rmq[i-1][j+ 2^(i-1)])

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

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

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

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

    for(int i=1;i<=m;++i)
    {
        int x,y;
        fin>>x>>y;
        int k=lg[y-x+1];
        fout<<min(rmq[k][x],rmq[k][y- (1<<k) +1])<<'\n';
    }
}