#include <fstream>
using namespace std;

ifstream cin ("rmq.in");
ofstream cout ("rmq.out");

int v[100001];
int a[18][100001];
int putere2[100001];
int main()
{
    int n,m;
    cin >>n>>m;
    for (int i = 1; i <= n; i++)
    {
        cin >>v[i];
        a[0][i] = v[i];
    }
    for (int i = 1; (1 << i) <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            a[i][j] = a[i - 1][j];
            if (j + (1 << (i - 1)) <= n && a[i][j] > a[i - 1][j + (1 << (i - 1))])
                a[i][j] = min(a[i - 1][j] , a[i - 1][j + (1 << (i - 1))]);
        }
    }
    putere2[1] = 0;
    for (int i = 2; i <= n; i++)
    {
        putere2[i] = 1 + putere2[i / 2];
    }
    for (int i = 1; i <= m; i++)
    {
        int st,dr;
        cin >>st>>dr;
        int e = putere2[dr - st + 1];
        cout <<min(a[e][st] , a[e][dr - (1 << e) + 1])<<"\n";
    }
    return 0;
}
/*
11
4 2 7 8 3 5 9 1 6 2 9
*/