Problem: A student's life is fraught with complications. Some Berland University students know this only too well. Having studied for two years, they contracted strong antipathy towards the chairperson of some department. Indeed, the person in question wasn't the kindest of ladies to begin with: prone to reforming groups, banning automatic passes and other mean deeds. At last the students decided that she just can't get away with all this anymore...

The students pulled some strings on the higher levels and learned that the next University directors' meeting is going to discuss n orders about the chairperson and accept exactly p of them. There are two values assigned to each order: ai is the number of the chairperson's hairs that turn grey if she obeys the order and bi — the displeasement of the directors if the order isn't obeyed. The students may make the directors pass any p orders chosen by them. The students know that the chairperson will obey exactly k out of these p orders. She will pick the orders to obey in the way that minimizes first, the directors' displeasement and second, the number of hairs on her head that turn grey.

The students want to choose p orders in the way that maximizes the number of hairs on the chairperson's head that turn grey. If there are multiple ways to accept the orders, then the students are keen on maximizing the directors' displeasement with the chairperson's actions. Help them.

Input

The first line contains three integers n (1 ≤ n ≤ 105), p (1 ≤ p ≤ n), k (1 ≤ k ≤ p) — the number of orders the directors are going to discuss, the number of orders to pass and the number of orders to be obeyed by the chairperson, correspondingly. Each of the following n lines contains two integers ai and bi (1 ≤ ai, bi ≤ 109), describing the corresponding order.

Output

Print in an arbitrary order p distinct integers — the numbers of the orders to accept so that the students could carry out the revenge. The orders are indexed from 1 to n in the order they occur in the input. If there are multiple solutions, you can print any of them.

Examples

Input

5 3 2
5 6
5 8
1 3
4 3
4 11


Output

3 1 2 

Input

5 3 3
10 18
18 17
10 20
20 18
20 18


Output

2 4 5 

Note

In the first sample one of optimal solutions is to pass orders 1, 2, 3. In this case the chairperson obeys orders number 1 and 2. She gets 10 new grey hairs in the head and the directors' displeasement will equal 3. Note that the same result can be achieved with order 4 instead of order 3.

In the second sample, the chairperson can obey all the orders, so the best strategy for the students is to pick the orders with the maximum sum of ai values. The chairperson gets 58 new gray hairs and the directors' displeasement will equal 0.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int N, P, K;
bool use[200000];
struct Ord {
  int a, b, no;
  Ord() {}
  Ord(int _a, int _b, int _no) {
    a = _a;
    b = _b;
    no = _no;
  }
} ord[200000];
bool cmp1(Ord p1, Ord p2) { return p1.b > p2.b || p1.b == p2.b && p1.a < p2.a; }
bool cmp2(Ord p1, Ord p2) { return p1.a > p2.a || p1.a == p2.a && p1.b > p2.b; }
int main() {
  scanf("%d %d %d", &N, &P, &K);
  for (int Ni = 0; Ni < N; Ni++) {
    int _a, _b;
    scanf("%d %d", &_a, &_b);
    ord[Ni] = Ord(_a, _b, Ni + 1);
  }
  sort(ord, ord + N, cmp1);
  bool flag = false;
  sort(ord, ord + N - P + K, cmp2);
  int _i = 0;
  for (int Ki = 0; Ki < K; Ki++) {
    if (flag) printf(" ");
    flag = true;
    printf("%d", ord[Ki].no);
    use[ord[Ki].no] = true;
    if (ord[Ki].b < ord[_i].b ||
        ord[Ki].b == ord[_i].b && ord[Ki].a > ord[_i].a)
      _i = Ki;
  }
  int _a = ord[_i].a, _b = ord[_i].b;
  int cnt = K;
  sort(ord, ord + N, cmp1);
  for (int Ni = 0; Ni < N; Ni++) {
    if (use[ord[Ni].no]) continue;
    if (cnt == P) break;
    if (ord[Ni].b < _b || ord[Ni].b == _b && ord[Ni].a >= _a ||
        ord[Ni].a == _a) {
      if (flag) printf(" ");
      flag = true;
      printf("%d", ord[Ni].no);
      use[ord[Ni].no] = true;
      cnt++;
    }
  }
  puts("");
}