#include <fstream>

using namespace std;

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

int n, m, x, y, lg[100010], A[22][100010];

inline int min (int x, int y) { if (x < y) return x; return y;}

inline int minim (int x, int y)
{
   int lin = lg[y - x + 1];
   return min (A[lin][x], A[lin][y - (1 << lin) + 1]);
}

int main()
{
    in >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
       in >> A[0][i];
    }

    for (int i = 2; i <= n; ++i)
       lg[i] = lg[i>>1] + 1;

    for (int i = 1; (1 << i) <= n; ++i)
    {
       for (int j = 1; j <= n; ++j)
       {
          A[i][j] = min (A[i-1][j], A[i-1][j + (1 << (i - 1) )]);
       }
    }

    for (int i = 1; i <= m; ++i)
    {
       in >> x >> y;
       out << minim (x, y) << '\n';
    }
}