def compute(data, n_min, n_max)
  gap = []
  n = n_min
  while n <= n_max
    diff = data[n] - data[n-1]
    gap.push([diff, n])
    n += 1
  end
  gap.sort! { |a, b|
    if a[0] != b[0]
      a[0] - b[0]
    else
      b[1] - a[1]
    end
  }
  puts gap[0][1]
end

while head = gets.split(" ")
  m = head[0].to_i
  n_min = head[1].to_i
  n_max = head[2].to_i
  break if m == 0 and n_min == 0 and n_max == 0
  
  data = []
  n = 0
  while n < m
    data.push(gets.to_i)
    n += 1
  end

  compute(data, n_min, n_max)
end