#include <bits/stdc++.h>

using namespace std;

const int max_size = 1e5 + 20, rmax = 20;

int rmq[rmax][max_size], lg[max_size];

void solve ()
{
    int n, q;
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
    {
        cin >> rmq[0][i];
    }
    for (int e = 1; e < rmax; e++)
    {
        for (int i = 1; i + (1 << e) - 1 <= n; i++)
        {
            rmq[e][i] = min(rmq[e - 1][i], rmq[e - 1][i + (1 << (e - 1))]);
        }
    }
    for (int i = 2; i <= n; i++)
    {
        lg[i] = lg[i / 2] + 1;
    }
    while (q--)
    {
        int x, y;
        cin >> x >> y;
        if (y > x)
        {
            swap(x, y); // de siguranta
        }
        int diff = y - x + 1, e = lg[diff];
        cout << min(rmq[e][x], rmq[e][y - (1 << e) + 1]) << '\n';
    }
    cout << '\n';
}

signed main ()
{
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#else
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    long long tt;
    //cin >> tt;
    tt = 1;
    while (tt--)
    {
        solve();
    }
    return 0;
}