#include <iostream>
#include <fstream>

using namespace std;

int v[400000];
int l[400000];
int q[400000][40];
int d[40];
int n, m, a, b, k;

int main()
{
    ifstream fin("date.in");
    ofstream fout("date.out");

    fin >> n >> m;

    for(int i = 1; i <= n; i++)
    {
        fin >> v[i];
        q[i][0] = v[i];
    }

    d[0] = 1;

    for(int i = 1; d[i-1] <= 100000; i++)
    {
        d[i] = 2 * d[i-1];
    }

    for(int i = 2; i <= 100000; i++)
    {
        l[i] = l[i/2] + 1;
    }

    for(int j = 1; j<= l[n]; j++)
    {
        for(int i = 1; i <= n; i++)
        {
            q[i][j] = min(q[i+d[j-1]][j-1], q[i][j-1]);
        }
    }

    for(int i = 1; i<= m; i++)
    {
        fin >> a >> b;
        k = l[b - a + 1];
        fout << min(q[b-d[k]+1][k], q[a][k]) << '\n';
    }

    return 0;
}