#include <fstream>

using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
int rmq[20][100005];
int lg[100005];
int n,m;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for(int i=2;i<=n;i++)
        lg[i] = lg[i/2] + 1;
    for(int i=1;i<=n;i++)
        cin >> rmq[0][i];
    for(int i=1;i<=lg[n];i++)
        for(int j=1;j+(1<<i)-1<=n;j++)
            rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
    for(int i=1;i<=m;i++)
    {
        int st,dr;
        cin >> st >> dr;
        if(st>dr)
            swap(st,dr);
        int d = dr - st + 1;
        int p = lg[d];
        cout << min(rmq[p][st],rmq[p][dr - (1<<p) + 1]) << '\n';
    }
    return 0;
}