#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int nmax = 1e5 + 5;
int dp[nmax][20], v[nmax];
void table(int n)
{
    int i, j;
    for(i = 1; i <= n; i++)
        dp[i][0] = v[i];
    for(j = 1; (1 << j) <= n; j++)
        for(i = 1; (i + (1 << j) - 1) <= n; i++)
            dp[i][j] = min(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
}
int query(int st, int dr)
{
    int log = (int)log2(dr - st + 1);
    if(dp[st][log] <= dp[dr - (1 << log) + 1][log])
        return dp[st][log];
    else
        return dp[dr - (1 << log) + 1][log];
}
int main()
{
    int n, i, j, q, a, b;
    cin >> n >> q;
    for(i = 1; i <= n; i++)
        cin >> v[i];
    table(n);
    while(q--){
        cin >> a >> b;
        cout << query(a, b) << "\n";
    }
    return 0;
}