Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Rank List

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAnother programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are shown its final place.

You know the rules of comparing the results of two given teams very well. Let's say that team *a* solved *p* _{ a} problems with total penalty time *t* _{ a} and team *b* solved *p* _{ b} problems with total penalty time *t* _{ b}. Team *a* gets a higher place than team *b* in the end, if it either solved more problems on the contest, or solved the same number of problems but in less total time. In other words, team *a* gets a higher place than team *b* in the final results' table if either *p* _{ a} > *p* _{ b}, or *p* _{ a} = *p* _{ b} and *t* _{ a} < *t* _{ b}.

It is considered that the teams that solve the same number of problems with the same penalty time share all corresponding places. More formally, let's say there is a group of *x* teams that solved the same number of problems with the same penalty time. Let's also say that *y* teams performed better than the teams from this group. In this case all teams from the group share places *y* + 1, *y* + 2, ..., *y* + *x*. The teams that performed worse than the teams from this group, get their places in the results table starting from the *y* + *x* + 1-th place.

Your task is to count what number of teams from the given list shared the *k*-th place.

Input

The first line contains two integers *n* and *k* (1 ≤ *k* ≤ *n* ≤ 50). Then *n* lines contain the description of the teams: the *i*-th line contains two integers *p* _{ i} and *t* _{ i} (1 ≤ *p* _{ i}, *t* _{ i} ≤ 50) — the number of solved problems and the total penalty time of the *i*-th team, correspondingly. All numbers in the lines are separated by spaces.

Output

In the only line print the sought number of teams that got the *k*-th place in the final results' table.

Examples

Input

7 2

4 10

4 10

4 10

3 20

2 1

2 1

1 10

Output

3

Input

5 4

3 1

3 1

5 3

3 1

3 1

Output

4

Note

The final results' table for the first sample is:

- 1-3 places — 4 solved problems, the penalty time equals 10
- 4 place — 3 solved problems, the penalty time equals 20
- 5-6 places — 2 solved problems, the penalty time equals 1
- 7 place — 1 solved problem, the penalty time equals 10

The table shows that the second place is shared by the teams that solved 4 problems with penalty time 10. There are 3 such teams.

The final table for the second sample is:

- 1 place — 5 solved problems, the penalty time equals 3
- 2-5 places — 3 solved problems, the penalty time equals 1

The table shows that the fourth place is shared by the teams that solved 3 problems with penalty time 1. There are 4 such teams.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/15/2020 23:51:46 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|