#include <iostream>
#include <fstream>
#define NMAX 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m;
int v[NMAX];
int rmq[20][NMAX];
int lg[NMAX];

void read()
{
    fin >> n >> m;
    for(int i = 1 ; i <= n ; i++)
        fin >> v[i];
}

void calc()
{
    lg[1] = 0;
    for(int i = 2 ; i <= n ; i++)
        lg[i] = lg[i/2] + 1;
    for(int i=1 ; i <= n ;i++)
    {
        rmq[0][i] = v[i];
    }
    for(int i=1 ; (1<<i) <= n ; i++)
    {
        for(int j = 1 ; j <= n - (1<<i) + 1 ; j++)
        {
            rmq[i][j] = min(rmq[i-1][j] , rmq[i-1][j + (1<<(i-1))]);
        }
    }
}

void solve()
{
    for (int i = 1 ;i <= m ; i++)
    {
        int x , y;
        fin >> x >> y ;
        if(x > y)
            swap(x , y);
        int k = lg[y - x + 1];
        fout << min(rmq[k][x] , rmq[k][y - (1 << k) + 1]) << '\n';
    }
}
int main()
{
    read();
    calc();
    solve();
    return 0;
}