#include <cstdio>
#include <algorithm>
#define Dim 100002
#define Logn 20

using namespace std;
int n, m, x, y, dp[Dim][Logn], Log[Dim];
void read()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++ i)
        scanf("%d", &dp[i][0]);
}
int Min(int x, int y)
{
    if(x < y)
        return x;
    return y;
}
void solve()
{
    int i, j;
    for(i = 2; i <= n; ++ i)
        Log[i] = Log[i / 2] + 1;
    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]);
}
void write()
{
    int Sol;
    while(m --)
    {
        scanf("%d %d", &x, &y);
        int L = Log[y - x + 1];
        Sol = Min(dp[x][L], dp[y - (1 << L) + 1][L]);
        printf("%d\n", Sol);
    }
}
int main()
{
    read();
    solve();
    write();
    return 0;
}