시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
0.1 초 1024 MB 0 0 0 0.000%

## 문제

Do you know The Battle for Wesnoth? It is a splendid turn-based strategy game with fantasy theme. There are elves, orcs, undead, dwarves, and even drakes roaring around! As for this problem, you must know that every unit has some number of hitpoints, which is reduced during combats, and you must also understand how the combat proceeds. We will be interested only in the simplest case -- a common attack at a defenseless unit.

Such an attack is described by three integers:

• $d$ -- the damage done by a successful blow;
• $b$ -- the number of blows;
• $p$ -- the probability (in percentage) that a blow is successful.

In the game, $d$ and $b$ are properties of the attacker, whereas $p$ is usually given by the terrain occupied by the defender, but for our purposes, we assume that it is a property of the attacker, too (as with magical attacks).

As an example, consider an attack with $d=6$, $b=2$, and $p=60$. There are three possible outcomes:

• By $16\,\%$, the attacker misses both times and does no damage at all.
• By $48\,\%$, the attacker hits with one of the blows and misses with the other one, doing the damage of $6$ hitpoints.
• By $36\,\%$, the attacker hits both times, doing the total damage of $12$ hitpoints.

When the number of hitpoints of the defending unit becomes non-positive, the unit dies.

David is currently playing an add-on where a special unit, the Elvish Princess, has a very special magical attack: Instead of $d$ and $b$, she is described by an integer $m$, and when she attacks, the player may choose $d$ and $b$ to be arbitrary positive integers as long as $d\cdot b\leq m$.

Every now and then, David needs his Elvish Princess to kill an ugly undead skeleton or a stinking orcish warrior, so he would like to know which choice of $d$ and $b$ gives the highest probability of killing the enemy.

For every unit David needs to kill, find the best choice of $d$ and $b$.

## 입력

The first line of the input contains an integer $m$ ($1\leq m\leq 10^6$) and an integer $p$ ($1\leq p\leq 99$) -- the parameters of the attacker. The second line contains an integer $n$ ($1\leq n\leq 10^5$) -- the number of units to be killed. The third line contains $n$ integers $h_1,h_2,\dots,h_n$ ($1\leq h_i\leq 10^6$), where $h_i$ is the number of hitpoints of the $i$-th unit to be killed.

## 출력

For each unit to be killed, output two integers: the $d$ and $b$ which give the maximum probability of killing the unit. Your answer will be accepted if the probability given by your output differs from the optimum by no more than $10^{-6}$.

## 예제 입력 1

10 60
3
5 6 7


## 예제 출력 1

5 2
2 5
7 1


## 힌트

The corresponding probabilities are $84\,\%$, $68.256\,\%$, and $60\,\%$.

The computation can be done with far enough precision using doubles. Of course, you must avoid overflow and underflow as well as doing unsafe operations like adding numbers of very different magnitudes (e.g. for $a=0.5$ and $b=10^{-100}$, $a+b$ would be evaluated equal to $a$).