#include <bits/stdc++.h>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int n, m, sir[100005], st, dr;

int dp[100005][25];

void create_table()
{
    for (int col=1, putere=2; putere<=n; col++, putere<<=1)
    {
        for (int i=1; i<=n; ++i)
        {
            dp[i][col]=min(dp[i][col-1],dp[i+(putere>>1)][col-1]);
        }
    }
}

int query()
{
    int dif=dr-st+1;
    int logaritm = log2(dif);

    return min(dp[st][logaritm],dp[dr-(1<<logaritm)+1][logaritm]);
}

int main()
{
    f >> n >> m;
    for (int i=1; i<=n; ++i)
    {
        f >> dp[i][0];
    }
    create_table();
    for (int i=1; i<=m; ++i)
    {
        f >> st >> dr;
        g << query() << '\n';
    }
    return 0;
}