There are N animals consisting of cats, fish, birds, and humans in a beautiful world.
Each animal has an unique name.
Initially, the HP of each animal is 0.
You have to perform the following operations:
The first line of the input contains a number N Q — the number of animals in the world and the number of operations.
Each of the next i = 1, 2, ..., N lines contains two strings — the species and the name of the i-th animal.
The next Q lines is one of the operations described in the statement.
N ≤ 1000
Q ≤ 300000
1 ≤ x ≤ 10 in operation Breath and Sleep
1 ≤ i, j ≤ N in every operation
Whenever there's an operation "Name <i>", print the name of the i-th animal.
Whenever there's an operation "Species <i>", print the species of the i-th animal.
Whenever there's an operation "HP <i>", print the HP of the i-th animal.
Whenever there's an operation "Talk <i>", print the corresponding sentences according to the problem statement.
Remember to print '\n' at the end of each line.