D. Prestige Hunter
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Our friend Sweat is constantly sweating about the prestige of the companies he is applying to. His friend, Perspirate, offered him a CSV table, which she claims is a comprehensive list of the most prestigious companies, alongside their ranking by prestige.

To help Sweat and Perspirate cope with their stress, you are tasked with building an application that, for each of $$$T$$$ inquiries, given a company name, check if it is on the list of prestigious companies - and if so, how highly it places on the prestige list.

The list of companies may be accessed at: https://pastebin.com/f3099efT

Input

First, one line, representing $$$T$$$.

Then, for each of the $$$T$$$ following lines, one string representing the company name - please disregard case.

You may assume $$$T\leq 1000$$$, and no line's input will be longer than 1000 characters in length.

Output

For each of the $$$T$$$ lines, if the company is in the list of prestigious companies, print the prestige ranking of the company (starting with 1), else print -1.

Example
Input
5
meta
Capital One
nETflIx
goOgLe
asdfrteghafdbdhsarwgdraet wegnfr
Output
117
40
126
87
-1