#include <fstream>
#include <cmath>

using namespace std;

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

int a[100001][21];
int n,m;
int x,y;

inline int min(int a,int b)
{
    return a<b?a:b;
}


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

    int k = 0;
    while( (1<<k) <= n) k++;
    k--;

    for(int j=1;j<=k;j++)
        for(int i=1;i<=n;i++)
        {
            a[i][j] = a[i][j-1];
            if(i+(1<<(j-1)) <=n && a[i][j] > a[ i+(1<<(j-1))][j-1])
                a[i][j] = a[ i+(1<<(j-1))][j-1];
        }
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        if(x==y)
            fout<<a[x][0]<<'\n';
        else
        {
            int k=floor(log(y-x)/log(2));
            fout<<min(a[x][k],a[y-(1<<k)+1][k])<<'\n';
        }
    }

    fin.close();
    fout.close();
    return 0;
}