#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <vector>
#include <iterator>
using namespace std;
ifstream fin("lupu.in");
ofstream fout("lupu.out");

int N, L, D;
struct Sheep
{
    bool operator()(pair < int, int > A, pair < int, int > B)
    {
        if(A.first != B.first)
         return A.first < B.first;
        return A.second > B.second;

    }
};
vector < pair < int, int > > V;
void Read()
{
    fin >> N >> L >> D;
    for(int i = 1; i <= N; ++ i)
    {
        int A, B;
        fin >> A >> B;
        if(A <= L)
          V.push_back(make_pair(A, B));
    }
    sort(V.begin(), V.end(), greater < pair < int, int > >());
}
void Task()
{
   int R = D;
   int counter_q = 0;
   pair < int, int > K = make_pair(V[0].first, V[0].second);
   priority_queue < int, vector < pair < int, int > >, Sheep > Q;

}
int main()
{
    Read();
    Task();
    return 0;
}