#include <stdio.h>
#include <ctype.h>

#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#define nmax 1000005
using namespace std;

int rmq[20][100005],n,q;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
void precalc()
{
    for(int j=1;(1<<j)<=n;j++)
    {
        for(int i=1;i+(1<<j)-1<=n;i++)
        {
           rmq[j][i]=min(rmq[j-1][i],rmq[j-1][i+(1<<(j-1))]);
        }
    }
}
int query(int l,int r)
{
    int j=log2(r-l+1);
    return min(rmq[j][l],rmq[j][r-(1<<j)+1]);
}
int main()
{InParser f("rmq.in");
ofstream g("rmq.out");
f>>n>>q;
for(int i=1;i<=n;i++)
{
    f>>rmq[0][i];
}
precalc();
for(int i=1;i<=q;i++)
{int l,r;
    f>>l>>r;
    g<<query(l,r)<<'\n';
}

}