#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
void read();
void build_table();
void solve();
int n, m;
vector<int> v[int(log2(NMAX))+5];
int main()
{
    read();
    build_table();
    solve();
    return 0;
}
void solve()
{
    for(int q=1; q<=m; ++q)
    {
        int x, y;
        fin >> x >> y;
        int p = log2(y-x+1);
        fout << min(v[p][x], v[p][y-(1<<p)+1]) << '\n';
    }
}
void build_table()
{
    for(int i=1; (1<<i) <= n; i++)
    {
        v[i].push_back(0);
        for(int j=1; j<=n-(1<<i)+1; j++)
            v[i].push_back(min(v[i-1][j], v[i-1][j+(1<<(i-1))]));
    }
}
void read()
{
    fin >> n >> m;
    v[0].push_back(0);
    for(int i=1; i<=n; i++)
    {
        int x;
        fin >> x;
        v[0].push_back(x);
    }
}