#include <fstream>

using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
int dp[20][100005];
int lg[100005];
int main()
{
    int n, m, i, j;
    cin >> n >> m;
    for (i = 1; i <= n; i++)
        cin >> dp[0][i];
    //lg[0] = -1;
    for (i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    for (i = 1; i <= lg[n]; i++)
    {
        for (j = 1; j + (1 << i) - 1 <= n ; j++)
        {
            dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + (1 << (i - 1))]);
        //    cout << dp[i][j] << " ";

        }
      //  cout << endl;
    }

    for (i = 1; i <= m; i++)
    {
        int a, b;
        cin >> a >> b;
        int lgg = lg[b - a + 1];
        cout << min(dp[lgg][a], dp[lgg][b - (1 << lgg) + 1]) << '\n';
    }
    return 0;
}