#include <bits/stdc++.h>
#define maxn 100000
#define logmaxn 17

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");

int n, Q, x, y, k, v[maxn + 1], M[maxn + 1][logmaxn + 1];

int main () {
    fin >> n >> Q;
    for (int i = 0; i < n; i ++) {
        fin >> v[i];
        M[i][0] = i;
    }
    for (int j = 1; (1 << j) <= n; j ++)
    for (int i = 0; i + (1 << j) - 1 < n; i ++)
    if (v[M[i][j - 1]] < v[M[i + (1 << (j - 1))][j - 1]]) M[i][j] = M[i][j - 1];
    else M[i][j] = M[i + (1 << (j - 1))][j - 1];
    while (Q --) {
        fin >> x >> y;
        x --, y --;
        k = log (y - x + 1);
        if (v[M[x][k]] <= v[M[y - (1 << k) + 1][k]]) fout << v[M[x][k]] << '\n';
        else fout << v[M[y - (1 << k) + 1][k]] << '\n';
    }
    return 0;
}