#include <bits/stdc++.h>

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

int n, m, lg[100010], rmq[100010][20];

void precalculare()
{
    lg[1] = 0;
    lg[2] = 1;
    for(int i=3; i<=100001; i++)
    {
        lg[i] = lg[i-1];
        if(i%(1<<lg[i-1]) == 0)
            lg[i] = lg[i-1]+1;
    }
    for(int j=1; j<=lg[n]+1; j++)
        for(int i=1; i<=n-(1<<j)+1; i++)
            rmq[i][j] = min(rmq[i][j-1], rmq[i+j][j-1]);
}

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

int main()
{
    int x, y;
    fin >> n >> m;
    for(int i=1; i<=n; i++)
        fin >> rmq[i][0];
    precalculare();
    for(int i=1; i<=m; i++)
    {
        fin >> x >> y;
        fout<<query(x, y)<<'\n';
    }
    return 0;
}