#include <bits/stdc++.h>

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 in("rmq.in");
OutParser out("rmq.out");

const int bsize = 220;

int n,q,a[100005];
int bmin[1005];

int main()
{
    in >> n >> q;
    for (int i = 1; i <= n; i++)
        in >> a[i];
    for (int i = 0; i <= n / bsize; i++)
        bmin[i] = 1e9;
    for (int i = 1; i <= n; i++)
        bmin[i / bsize] = min(bmin[i / bsize],a[i]);
    for (int i = 1; i <= q; i++)
    {
        int l,r;
        in >> l >> r;
        int bucketl = l / bsize,bucketr = r / bsize;
        if (bucketl + 1 >= bucketr)
        {
            int minim = 1e9;
            for (int j = l; j <= r; j++)
                minim = min(minim,a[j]);
            out << minim << '\n';
        }
        else
        {
            int minim = 1e9;
            for (int j = l; j < bsize * (bucketl + 1); j++)
                minim = min(minim,a[j]);
            for (int j = bsize * bucketr; j <= r; j++)
                minim = min(minim,a[j]);
            for (int j = bucketl + 1; j < bucketr; j++)
                minim = min(minim,bmin[j]);
            out << minim << '\n';
        }
    }
    return 0;
}