#include <fstream>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <string.h>
#include <queue>
#include <math.h>
#include <set>
#include <stack>

#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a<b)?b:a)
#define abs(a) ((a<0)?-a:a)
#define REP(i,a,b) \
	for (int i=a; i<=b; i++)

#define INF 1000000000

using namespace std;

//#define TEST
#ifdef TEST
ifstream fin("input.txt");
ofstream fout("output.txt");
#else
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#endif // TEST

#define MAXN 2000000001
#define pb push_back
#define mp make_pair
#define MOD 1000000007

typedef long long ll;
typedef pair<int,int> pp;

int n,m;
int a[100000];

int dp[100000][19];

void init()
{
    for (int i=0; i<n; i++)
        dp[i][0] = a[i];

    for (int i=1; 1<<i < n; i++)
    {
        for (int j=0; j+ (1<<i) <=n; j++)
            dp[j][i] = min(dp[j][i-1],dp[j + 1<<(i-1)][i-1]);
    }
}

int query(int l, int r)
{
    int k;
    k = (int)log2(r-l+1);
    return min(dp[l][k],dp[r- (1<<k)+1 ][k]);
}

int main()
{
    fin>>n>>m;
    for (int i=0; i<n; i++)
        fin>>a[i];

    init();

    for (int i=0; i<m; i++)
    {
        int x,y;
        fin>>x>>y;
        fout<<query(x-1,y-1);
        fout<<'\n';
    }

	return 0;
}