#include <fstream>
#include <vector>
using namespace std;
string file = "rmq";
ifstream cin (file + ".in");
ofstream cout (file + ".out");
const int N = 100000;
vector <int> p;
int dp[17][N+1], v[N+1];
void putere(int n)
{
    p.push_back(1);
    while (p.back() <= n)
    {
        p.push_back(p.back() << 1);
    }
    p.pop_back();
}

void RMQ(int n)
{
    for (int i=1; i<=n; i++)
    {
        dp[0][i] = v[i];
    }
    int k = p.size();
    for (int i=1; i<k; i++)
    {
        for (int j=1; j<=p[i-1]; j++)
            dp[i][j] = dp[i-1][j];
        for (int j=p[i-1]+1; j<=n; j++)
            dp[i][j] = min(dp[i-1][j-p[i-1]],dp[i-1][j]);
    }
}

int cb (int x)
{
    int st = 0, dr = p.size()-1;
    while (st <= dr)
    {
        int mid = (st+dr)/2;
        if (p[mid] <= x)
        {
            st = mid+1;
        }
        else
        {
            dr = mid-1;
        }
    }
    return dr;
}
int main ()
{
    int n,m,st,dr;
    cin >> n >> m;
    putere(n);
    for (int i=1; i<=n; i++)
    {
        cin >> v[i];
    }
    RMQ(n);
    for (int i=1; i<=m; i++)
    {
        cin >> st >> dr;
        int e = cb(dr-st+1);
        cout << min(dp[e][st+p[e]-1], dp[e][dr]) << '\n';
    }
}