#include <bits/stdc++.h>

using namespace std;

const int N = 100000 + 3;
const int LG = 17;

int n, Q;
int Rmq[N][LG];
int Log[N];

int32_t main()
{
     //   freopen("rmq.in", "r", stdin);
     //   freopen("rmq.out", "w", stdout);
        cin >> n >> Q;
        for(int i = 1; i <= n; i++)
                cin >> Rmq[i][0];
        for(int i = 2; i <= n; i++)
                Log[i] = 1 + Log[i / 2];
        for(int k = 1; (1 << k) <= n; k++)
                for(int i = 1; i + (1 << k) - 1 <= n; i++)
                        Rmq[i][k] = min(Rmq[i][k - 1], Rmq[i + (1 << (k - 1))][k - 1]);
        for(int i = 1; i <= Q; i++)
        {
                int tl, tr;
                cin >> tl >> tr;
                int k = Log[tr - tl + 1];
                int __min = min(Rmq[tl][k], Rmq[tr - (1 << k) + 1][k]);
                cout << __min << "\n";
        }
}