#include <fstream>
#include <cstring>
#include <deque>
using namespace std;
static const int MAXN = 100009;
static const int INF = 0x3F3F3F3F;
static const int MAXR = 300;
int n, m;
int v[MAXN];
int mr[MAXN / MAXR + 1];
int main()
{
int x, y;
ifstream f("rmq.in");
ofstream g("rmq.out");
f >> n >> m;
memset(mr, 0x3F, sizeof(mr));
for(int i = 1; i <= n; i++)
{
f >> v[i];
mr[(i - 1) / MAXR] = min(mr[(i - 1) / MAXR], v[i]);
}
for(int i = 0; i < m; i++)
{
f >> x >> y;
int ans = INF;
int j;
for(j = x; j <= y && (j - 1) % MAXR != 0; j++)
{
ans = min(ans, v[j]);
}
for(; j + MAXR - 1 <= y; j+= MAXR)
{
ans = min(ans, mr[j]);
}
for(; j <= y; j++)
{
ans = min(ans, v[j]);
}
g << ans << '\n';
}
f.close();
g.close();
return 0;
}