n schoolchildren come to the trainer for classes for preparing to Programming Olympiad. For each schoolchild there are two parameters: initial conditional experience ai and conditional intelligence bi.

Each lesson is organized in the next way: the trainer approaches a student and discusses the questions and problems that arise with him. As a result of this discussion, the conditional experience of this student will increase by bi (that is, the higher the conventional intelligence of the student, the more this student can take from communication with the trainer).

During the preparation for the Olympiad, the coach can approach all students in total no more than c times (he can approach different students, can approach several times to the same schoolboy). In order for the schoolchild to become a prize-winner of the Olympiad, at the start of the Olympiad his conditional experience should be no less than k.

Write a program that will calculate the maximum number of Olympiad winners that a coach can prepare.

Input

Сначала вводятся натуральные числа n, c, k (1 ≤ n ≤ 106, 1 ≤ c ≤ 109, 1 ≤ k ≤ 109), задающие количество школьников, количество подходов, которые может сделать учитель, и условный опыт, необходимый, чтобы стать призёром олимпиады, соответственно. Далее идёт n пар целых неотрицательных чисел ai, bi, задающих начальный условный опыт и условный интеллект каждого школьника. Каждое из чисел ai и bi не превышает 109.

Output

Print the largest number of prize-winners of the Olympiad, that the trainer can prepare.