#include <fstream>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;

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;
	}
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

InParser fin("rmq.in");
OutParser fout("rmq.out");

const int NMAX = 1e5;
const int VMAX = 1e5;

int n, q;
int a[NMAX + 1], aib1[NMAX + 1], aib2[NMAX + 1];

static inline int ub(int x){
    return x & (-x);
}

static inline int my_min(int a, int b){
    return a < b ? a : b;
}

static inline int query1(int x, int y){
    int res = VMAX;
    for(; x + ub(x) <= y; x += ub(x))
        res = my_min(res, aib2[x]);
    return my_min(res, a[x]);
}

static inline int query2(int x, int y){
    int res = VMAX;
    for(; y - ub(y) >= x; y -= ub(y))
        res = my_min(res, aib1[y]);
    return res;
}

int l, r;

void solve() {
    fin >> n >> q;
    for(int i = 1; i <= n; i++)
        aib1[i] = aib2[i] = VMAX;
    for(int i = 1; i <= n; i++){
        fin >> a[i];
        aib1[i] = my_min(aib1[i], a[i]);
        int next = i + ub(i);
        if(next <= n)
            aib1[next] = my_min(aib1[next], aib1[i]);
    }
    for(int i = n; i > 0; i--){
        aib2[i] = my_min(aib2[i], a[i]);
        int prev = i - ub(i);
        if(prev > 0)
            aib2[prev] = my_min(aib2[prev], aib2[i]);
    }
    while(q--){
        fin >> l >> r;
        fout << my_min(query1(l, r), query2(l, r)) << '\n';
    }
}

int main() {
    solve();
}