#include <fstream>

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

int n, m, r[20][100001], log2[100001];

int main()
{
    cin>>n>>m;
    for(int i = 1; i <= n; ++i)
    {
        cin>>r[0][i];
    }

    //pre
    for(int p = 1; (1<<p) <= n; ++p)
    {
        for(int i = 1; i <= n; ++i)
        {
            r[p][i] = r[p-1][i];
            int j = (1<<(p-1)) + i;
            if(j <= n)
                r[p][i] = min(r[p][i], r[p-1][j]);
        }
    }
    log2[1] = 0;
    for(int i = 2; i <= n; ++i)
        log2[i] = log2[i/2] + 1;

    //queryuri
    for(int i = 1; i <= m; ++i)
    {
        int st, dr;
        cin>>st>>dr;
        int p = log2[dr - st + 1];
        int mini = min(r[p][st], r[p][dr - (1<<p) + 1]);
        cout<<mini<<"\n";
    }

    return 0;
}