#include <cstdio>
#include <cmath>

using namespace std;

const int nmx = 100002;

int n,m;
int dp[20][nmx];

inline int min(const int &v1, const int &v2)
{
    return v1 < v2 ? v1 : v2;
}

void citire()
{
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++i)
        scanf("%d", &dp[0][i]);
}

void dinamica()
{
    for(int i = 1; (1 << i) <= n; ++i)
        for(int j = 1; j + (1 << i) <= n + 1; ++j)
            dp[i][j] = min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
}

int query(int a, int b)
{
    int put = log2(b-a+1);
    return min(dp[put][a],dp[put][b-(1<<put)+1]);
}

void rezolvare()
{
    for(int i = 1; i <= m; ++i)
    {
        int a,b;
        scanf("%d %d", &a, &b);
        printf("%d\n", query(a,b));
    }
}

int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    citire();
    dinamica();
    rezolvare();
    return 0;
}