#define programstate2
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned ll
#define vec vector
#define flist forward_list
#define um unordered_map
#define us unordered_set
#define prioq priority_queue
#define all(x) x.begin(), x.end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ld long double
#define cd complex<ld>
#define pll pair<ll, ll>
#define tll tuple<ll, ll, ll>
#define ass assign
#define fun function

#define LL_MAX LLONG_MAX
#define LL_MIN LLONG_MIN
#define ULL_MAX ULLONG_MAX
#define LD_MAX LDBL_MAX
#define LD_MIN LDBL_MIN

#define nl '\n'

#define vv(type, name, n, ...) vector<vector<type>> name(n, vector<type>(__VA_ARGS__))
#define vvv(type, name, n, m, ...) \
    vector<vector<vector<type>>> name(n, vector<vector<type>>(m, vector<type>(__VA_ARGS__)))

// https://trap.jp/post/1224/
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(ll)(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rep1e(n) for(ll i=1; i<=(ll)(n); ++i)
#define rep2e(i,n) for(ll i=1; i<=(ll)(n); ++i)
#define rep3e(i,a,b) for(ll i=(ll)(a); i<=(ll)(b); ++i)
#define rep4e(i,a,b,c) for(ll i=(ll)(a); i<=(ll)(b); i+=(ll)(c))
#define repe(...) cut4(__VA_ARGS__,rep4e,rep3e,rep2e,rep1e)(__VA_ARGS__)
#define per1(n) for(ll i=(ll)(n)-1; i>=0; --i)
#define per2(i,n) for(ll i=(ll)(n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=(ll)(a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=(ll)(a)-1; i>=(ll)(b); i-=(ll)(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define per1e(n) for(ll i=(ll)(n); i>=1; --i)
#define per2e(i,n) for(ll i=(ll)(n); i>=1; --i)
#define per3e(i,a,b) for(ll i=(ll)(a); i>=(ll)(b); --i)
#define per4e(i,a,b,c) for(ll i=(ll)(a); i>=(ll)(b); i-=(ll)(c))
#define pere(...) cut4(__VA_ARGS__,per4e,per3e,per2e,per1e)(__VA_ARGS__)
#define rep_subset(i,s) for(ll i=0;i!=-1;i=i==(s)?-1:(i|~(s))+1&(s))
#define per_subset(i,s) for(ll i=(s);i!=-1;i=i==0?-1:i-1&(s))

template<class T, class S> bool mkmin(T& a, const initializer_list<S>& b)
{S m = *min_element(all(b)); if(m<a){a=m;return 1;}return 0;}
template<class T, class S> bool mkmax(T& a, const initializer_list<S>& b)
{S m = *max_element(all(b)); if(m>a){a=m;return 1;}return 0;}
template<class T, class S> bool mkmin(T& a, const S& b){if(b<a){a=b;return 1;}return 0;}
template<class T, class S> bool mkmax(T& a, const S& b){if(b>a){a=b;return 1;}return 0;}

#ifdef programstate0
#endif

#ifdef programstate1
ifstream fin("./special/input.txt");
ofstream ferr("./special/messages.txt");
#define cerr ferr
#define cin fin
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(vector<vector<T>> x){cerr << "\n"; for(auto i: x) {for(auto j : i) {cerr << j << ' ';} cerr << "\n";}}
template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 777771449
#endif

const ll MOD = 1e9 + 7;
const ll INF = (1ll << 59);

#ifdef programstate2
const string FILENAME = "rmq";
ifstream fin(FILENAME + ".in");
ofstream fout(FILENAME + ".out");
#define cin fin
#define cout fout
#endif

volatile ll info[10] = {0};

struct tnode
{
	ll y, val, minval, sz;
	tnode *l, *r;

	tnode(ll prio, ll v)
	{
		val = minval = v;
		sz = 1;
		l = r = NULL;
		y = prio;
	}
};
typedef tnode* pnode;

namespace treap
{
	ll sz(pnode o){return o?o->sz:0;}
	void updateNode(pnode o)
	{
		if(!o) return;

		o->sz = sz(o->l) + sz(o->r);
		o->minval = o->val;
		if(o->l) mkmin(o->minval, o->l->minval);
		if(o->r) mkmin(o->minval, o->r->minval);
	}
	void split(pnode o, pnode& a, pnode& b, ll x, ll add = 0)
	{
		if(!o) return void(a=b=NULL);

		ll ox = sz(o->l) + add;
		if(ox <= x) split(o->r, o->r, b, x, ox+1), a = o;
		else split(o->l, a, o->l, x, add), b = o;
		updateNode(a);
		updateNode(b);
	}
	void merge(pnode& o, pnode a, pnode b)
	{
		if(!a || !b) o = a?a:b;
		else if(a->y > b->y) merge(a->r, a->r, b), o = a;
		else merge(b->l, a, b->l), o = b;
		updateNode(o);
	}
	void insert(pnode& o, pnode a, ll x)
	{
		pnode u;
		split(o, o, u, x-1);
		merge(o, o, a);
		merge(o, o, u);
	}
	ll query(pnode& o, ll x, ll y)
	{
		pnode u, v;
		split(o, o, u, x-1);
		split(u,u,v, y, sz(o));

		ll ans = u->minval;

		merge(o, o, u);
		merge(o, o, v);
		return ans;
	}
}

void crashHandler(int s)
{
	cout << "ERROR:" << nl;
	for(auto& e : info) cout << e << nl;
	cout << "ERROR END";
	cout.flush();
	
	exit(s);
}

int main()
{
	signal(SIGSEGV, crashHandler);
	fill(begin(info), end(info), -69);
    srand(time(0));

    ll n, q;
    cin >> n >> q;

    pnode root = NULL;

    rep(n)
    {
        ll x;
        cin >> x;

        pnode newNode = new tnode(rand(), x);
        treap::insert(root, newNode, i);
    }

    rep(q)
    {
		// info[0] = i;
        ll l, r;
        cin >> l >> r;
        l--, r--;

        cout << treap::query(root, l, r) << nl;
		// info[1] = i;
    }

    return 0;
}