PROGRAMMING:Keven hit the monster
As we all know, demacia is a place where monsters often appear. Every time there are monsters, Keven will defeat him immediately. But Keven was tired of fighting monsters every day, so he decided to send his disciples to fight monsters in the future.
His disciples are practicing at the beginning. Only when they reach a certain time can one of his disciples finish his practice. The ability value of this disciple is $$a $$, and the cost of each fight against a monster is $$B $$（ You can only fight monsters after training.)
When a monster with the ability of $$B $, Keven will immediately choose an apprentice who can win the monster and spend the least gold to fight the monster（ Because Keven is very poor and doesn't want to spend extra money.)
Only when the apprentice's ability value is greater than or equal to the monster's ability value, we think that the apprentice can win the monster. If no apprentice can win the monster, Keven will go out and kill him himself（ Let's assume that it doesn't take time for an apprentice to defeat a monster, just gold coins.)
This is very difficult for Keven, so he threw this question to you in ACM-ICPC. Can you help him answer this question?
###Input format:
The first line is a positive integer $$t (T < = 5) $$, which indicates the number of groups of data.
There is a positive integer $$n (1 < = n < = 10 ^ 5) $$in the first row of each group of data, which means there are $$n $$rows next. For each line:
1. If the first number is 0, then the next two positive integers $$a $, $$C $$indicate that an apprentice has completed the cultivation and obtained the ability of $$a $, and the cost of each play is $$C $.
2. If the first number is 1, then the next positive integer $$B $$indicates that a monster with the ability of $$B $$appears in demacia.
Input data guarantee $$(1 < = a, B, C < = 10 ^ 9)$$
###Output format:
For each monster, output an integer to indicate the minimum cost of defeating the apprentice he needs to send. If no apprentice can beat him, output "- 1"（ (excluding quotation marks)
###Input example:
```in
one
eight
1 19
0 17 5
0 1 6
1 12
1 15
0 5 7
0 3 9
1 3
```
###Output example:
```out
-1
five
five
five
```
###Example explanation:
```
1 19 means that a monster with the ability of 19 appears, and no apprentice can defeat him at this time.
1 12 means that a monster with ability of 12 appears. At this time, only apprentices with ability of 17 and cost of 5 can defeat him.
1 15 means that a monster with ability of 15 appears. At this time, only apprentices with ability of 17 and cost of 5 can defeat him.
1 3 means that a monster with ability 3 appears. The apprentice with ability 3 costs 9, the apprentice with ability 5 costs 7, and the apprentice with ability 17 costs 5. Obviously, the apprentice with ability 17 costs at least 5.
```
answer：If there is no answer, please comment
His disciples are practicing at the beginning. Only when they reach a certain time can one of his disciples finish his practice. The ability value of this disciple is $$a $$, and the cost of each fight against a monster is $$B $$（ You can only fight monsters after training.)
When a monster with the ability of $$B $, Keven will immediately choose an apprentice who can win the monster and spend the least gold to fight the monster（ Because Keven is very poor and doesn't want to spend extra money.)
Only when the apprentice's ability value is greater than or equal to the monster's ability value, we think that the apprentice can win the monster. If no apprentice can win the monster, Keven will go out and kill him himself（ Let's assume that it doesn't take time for an apprentice to defeat a monster, just gold coins.)
This is very difficult for Keven, so he threw this question to you in ACM-ICPC. Can you help him answer this question?
###Input format:
The first line is a positive integer $$t (T < = 5) $$, which indicates the number of groups of data.
There is a positive integer $$n (1 < = n < = 10 ^ 5) $$in the first row of each group of data, which means there are $$n $$rows next. For each line:
1. If the first number is 0, then the next two positive integers $$a $, $$C $$indicate that an apprentice has completed the cultivation and obtained the ability of $$a $, and the cost of each play is $$C $.
2. If the first number is 1, then the next positive integer $$B $$indicates that a monster with the ability of $$B $$appears in demacia.
Input data guarantee $$(1 < = a, B, C < = 10 ^ 9)$$
###Output format:
For each monster, output an integer to indicate the minimum cost of defeating the apprentice he needs to send. If no apprentice can beat him, output "- 1"（ (excluding quotation marks)
###Input example:
```in
one
eight
1 19
0 17 5
0 1 6
1 12
1 15
0 5 7
0 3 9
1 3
```
###Output example:
```out
-1
five
five
five
```
###Example explanation:
```
1 19 means that a monster with the ability of 19 appears, and no apprentice can defeat him at this time.
1 12 means that a monster with ability of 12 appears. At this time, only apprentices with ability of 17 and cost of 5 can defeat him.
1 15 means that a monster with ability of 15 appears. At this time, only apprentices with ability of 17 and cost of 5 can defeat him.
1 3 means that a monster with ability 3 appears. The apprentice with ability 3 costs 9, the apprentice with ability 5 costs 7, and the apprentice with ability 17 costs 5. Obviously, the apprentice with ability 17 costs at least 5.
```
answer：If there is no answer, please comment