#include <fstream>
#include <bitset>
#include <stack>
using namespace std;
#define mini(a, b) (a)<(b)?(a):(b)
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int MAX = 100001;
int rmq[18][MAX], n, lg[MAX], m;
void build_rmq()
{
    for(int i=2; i<=n; i++) lg[i] = 1 + lg[i/2];
    for(int i=1; i<=lg[n]; i++)
        for(int j=1; j<=n+1-(1<<i); j++)
            rmq[i][j] = mini(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
}
int getmin(int a, int b)
{
    int lin = lg[b-a+1];
    return mini(rmq[lin][a], rmq[lin][b+1-(1<<lin)]);
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++)
        fin>>rmq[0][i];
    build_rmq();
    for(int i=1; i<=m; i++){
        int a, b;
        fin>>a>>b;
        fout<<getmin(a, b)<<'\n';
    }
}