A company's new-hire buddy program tracks, for every employee, who onboarded them. Each employee has a unique numeric ID, a name, and a sponsorId, the ID of the employee who sponsored their onboarding, or 0 if they joined with no sponsor at all. Given the roster and one flagged sponsor ID K, print the name of every employee who was NOT personally sponsored by the employee with ID K, in the same order the roster was given.

Input format

Line 1: two space-separated integers n and K, the number of employees and the flagged sponsor ID. Each of the next n lines contains an employee record: an integer id, a name (a single token of letters and/or digits, 1 to 30 characters), and an integer sponsorId (0 if the employee has no sponsor).

Output format

Print the name of every employee whose sponsorId is not equal to K, one name per line, in the same order the employees appeared in the input. If no employee qualifies, print nothing.

Constraints

• 1 <= n <= 1000
• 1 <= id <= 10^6, and all ids are distinct
• 1 <= K <= 10^6
• 0 <= sponsorId <= 10^6
• each name consists of 1 to 30 letters and/or digits, with no spaces

6 2
1 Ravi 0
2 Nora 0
3 Kofi 2
4 Elena 0
5 Tomas 1
6 Sana 2

Ravi
Nora
Elena
Tomas

3 5
1 Amara 0
2 Ben 1
3 Chidi 2

Amara
Ben
Chidi