#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;

const string file = "rmq";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f; 

//#define ONLINE_JUDGE

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fin(infile.c_str(), ios::in);
	fstream fout(outfile.c_str(), ios::out);
#endif	

    int N, M;
    fin >> N >> M;
    vector<int> A(N);
    for(int i = 0; i < N; i++)
    {
        fin >> A[i];
    }

    vector<int> lg(N + 1, 0);
    lg[2] = 1;
    for(int i = 3; i <= N; i++)
    {
        lg[i] = lg[i/2] + 1;
    }
    vector<vector<int> > RMQ(lg[N] + 1);

    RMQ[0].resize(N);
    for(int i = 0; i < N; i++)
    {
        RMQ[0][i] = A[i];
    }

    for(int i = 1; i <= lg[N]; i++)
    {
        RMQ[i].resize(N - (1 << i) + 1);
        for(int j = 0; j < N - (1 << i) + 1; j++)
        {
            RMQ[i][j] = min(RMQ[i-1][j], RMQ[i-1][j + (1 << (i - 1))]);
        }
    }
    for(int i = 0; i < M; i++)
    {
        int x, y;
        fin >> x >> y;
        x --;
        y --;
        if(x > y)
            swap(x, y);
        int len = y - x + 1;
        int d = lg[len];
        int diff = len - (1 << d);

        fout << min(RMQ[d][x], RMQ[d][x + diff]) << "\n";
    }

#ifdef ONLINE_JUDGE
#else
    fout.close();
	fin.close();
#endif
}