#include <bits/stdc++.h>
#define fast ios_base :: sync_with_stdio(0); cin.tie(0);
#pragma GCC optimize("O3")
#define FILE_NAME "rmq"
#define NMAX 100000 + 100
#define vs nod<<1
#define vd nod<<1|1
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> llp;
typedef pair<ld,ld> pct;

const ll inf = 1LL << 60;
const ll mod = 1e9 + 7;
const ld eps = 1e-9;

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

inline void add(ll &a , ll b)
{
    a += b;
    a %= mod;
}

inline void sub(ll &a, ll b)
{
    a = (a - b + mod) % mod;
}

int n, q, rmq[20][NMAX], lg[NMAX];

int main()
{
    ///fast;
    f >> n >> q;
    for(int i = 1; i <= n; ++i)
        f >> rmq[0][i];
    for(int i = 2; i <= n; ++i)
        lg[i] = 1 + lg[i / 2];
    for(int i = 1; i <= lg[n]; ++i)
        for(int j = 1; j + (1 <<  (i - 1) ) <= n; ++j)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 <<  (i - 1) )]);
    while(q--)
    {
        int x, y;
        f >> x >> y;
        int L = lg[y - x + 1];
        int r = min(rmq[L][x], rmq[L][ y - (1 << L) + 1 ]);
        g << r << '\n';
    }
    f.close();
    g.close();
    return 0;
}