#include <iostream>
#include <fstream>
using namespace std;

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

int n,  m;
int A[100001],M[100001];
int x,y;

void initialize(int node, int b, int e)
{
  if (b == e)
    M[node] = b;
  else
    {

    initialize(2 * node, b, (b + e) / 2);
    initialize(2 * node + 1, (b + e) / 2 + 1, e);

    if (A[M[2 * node]] <= A[M[2 * node + 1]])
      M[node] = M[2 * node];
    else
      M[node] = M[2 * node + 1];
  }
}
int query(int node, int b, int e, int i, int j)
{
  int p1, p2;


  if (i > e || j < b)
    return -1;


  if (b >= i && e <= j)
    return M[node];


  p1 = query(2 * node, b, (b + e) / 2, i, j);
  p2 = query(2 * node + 1, (b + e) / 2 + 1, e, i, j);


  if (p1 == -1)
    return p2;
  if (p2 == -1)
    return p1;

  if (A[p1] <= A[p2])
    return M[node] = p1;
  return M[node] = p2;
}

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

    initialize(1,0,n-1);
    for(int i=1; i<=n; i++)
    {
        f>>x>>y;
        g<<query(1,0,n-1,x,y)<<'\n';
    }

    return 0;
}