#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define dbg(x) (cerr<<#x<<" = "<<(x)<<endl)

using namespace std;

const int nmax = 100005;
const int lmax = 17;

int n, m, i, j, p, P, x, y, dif;
int power[nmax], lg[nmax], rmq[lmax][nmax];

int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);

    scanf("%d%d", &n, &m);

    for(i = 1; i <= n; i++)
        scanf("%d", &rmq[0][i]);

    for(i = 1, P = 1, p = 2; p <= n; i++, p <<= 1, P <<= 1)
        for(j = 1; j <= n - p + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + P]);

    for(i = 1, j = 0; i <= n; i++)
    {
        if((1 << j) == i)
        {
            power[i] = 1 << j;
            lg[i] = j;
            j++;
        }
        else
        {
            power[i] = power[i - 1];
            lg[i] = lg[i - 1];
        }
    }

    for(; m; m--)
    {
        scanf("%d%d", &x, &y);

        dif = y - x + 1;

        p = power[dif];
        i = lg[dif];

        printf("%d\n", min(rmq[i][x], rmq[i][y - p + 1]));
    }
    return 0;
}