#include <bits/stdc++.h>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int maxn = 1e5 + 5;

int n, m;
int v[maxn];
int lg[maxn];
int rmq[19][maxn];

inline int get(int x, int y)  {
    int kk = (y - x + 1);
    kk = lg[kk];
    return min(rmq[kk][x], rmq[kk][y - (1 << kk) + 1]);
}

int main()  {
    fin >> n >> m;
    for(int i = 1;i <= n;i++)  {
        fin >> v[i];
        rmq[0][i] = v[i];
    }
    for(int i = 2;i <= n;i++)
        lg[i] = lg[i / 2] + 1;
    for(int i = 1;i <= lg[n];i++)  {
        for(int j = 1;j <= n - (1 << i) + 1;j++)  {
//            if(i == 2)
//                cerr << j << " " << rmq[i - 1][j] << rmq[i - 1];
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
        }
    }
    for(int i = 1;i <= m;i++)  {
        int x, y;
        fin >> x >> y;
        fout << get(x, y) << "\n";
    }
    return 0;
}