Shop

You are a middle manager at a store. Your boss has asked you to run a promotion that draws in customers. Under the promotion, a buyer who purchases one product receives another product as a gift.

You are given the product that will come with a gift. The gift must cost at least $a$ percent and at most $b$ percent of the product's price. For the store's benefit, the gift's price must be as low as possible.

Choose the gift for the given product.

The first line contains the name of the product that will come with a gift. The second line contains the product's price $t$ ($1 \le t \le 10^9$). The third line contains two positive integers $a$ and $b$ ($1 \le a \le b \le 100$). The fourth line contains $n$ ($1 \le n \le 1000$), the number of candidate gift products.

Each candidate is described by two lines. The first line is the candidate's name, and the second line is its price $x_i$ ($1 \le x_i \le 10^9$).

All candidate prices are distinct. Names are at most 20 characters long and use characters with codes 32 to 127, which means Latin letters, punctuation, arithmetic signs, digits, and spaces.

Print the name of the candidate chosen as the gift on a single line. The problem guarantees that such a candidate exists.