#include <bits/stdc++.h>

using namespace std;

FILE *fin=fopen("rmq.in", "r");
ofstream fout("rmq.out");

int n, m, d[20][100002];

int exp2(int x)
{
    int ct=0, p=1;
    while(p<=x)
    {
        p<<=1;
        ct++;
    }
    if(p>x)
        return ct-1;
    return ct;
}

int putere2(int k)
{
    int p=1;
    while(k)
    {
        p<<=1;
        k--;
    }
    return p;
}

int main()
{
    int i, j, k, nr, x, y;
    fscanf(fin, "%d%d", &n, &m);
    for(i=1; i<=n; i++)
        fscanf(fin, "%d", &d[0][i]);
    k=exp2(n);
    nr=1;
    for(i=1; i<=k; i++)
    {
        for(j=1; j<=n-nr; j++)
        {
            d[i][j]=min(d[i-1][j],d[i-1][j+nr]);
        }
        nr<<=1;
    }
    for(i=1; i<=m; i++)
        {
            fscanf(fin, "%d%d", &x, &y);
            k=exp2(y-x);
            fout<<min(d[k][x],d[k][y-putere2(k)+1])<<'\n';
        }
    return 0;
}