Submit Solution(Code Jam Page)
### Problem

### Input

### Output

### Limits

#### Small dataset

#### Large dataset

### Sample

In the second example, Diana should give up the first monster. During
her first two turns she should soften up the third monster bringing it
down to 80 hp, allowing her to easily get the last shot on the second
and the third monsters.

Diana needs your help maximizing her gold while playing her favorite
game. She is often faced with a scenario where she is standing close to
her tower and is facing **N** monsters. When that happens, Diana and the tower take turns shooting the monsters, and she goes first. During her turn, Diana *may*
choose a monster to shoot at (this means Diana may choose to skip a
turn). During its turn, the tower shoots the monster closest to it.
Diana and the tower can not shoot dead monsters.

If Diana shoots at a monster, its hit points are reduced by **P**. If the tower shoots at a monster, its hit points are reduced by **Q**. If a monster's hit points are reduced below 1, it is killed. The `i`

^{th} monster starts with **H _{i}** hit points. Diana is awarded

`i`

The first line of the input gives the number of test cases, **T**. **T** test cases follow. Each case begins with one line containing three space-separated integers representing **P**, **Q** and **N**. **N** lines then follow, with the `i`

^{th} line containing two space-separated integers representing **H _{i}** and

The monsters are given in the order of their distance from the tower. In other words, the tower will shoot at the

`i`

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is the maximum amount of gold that Diana can obtain.

1 ≤ **T** ≤ 100

20 ≤ **P** ≤ 200

20 ≤ **Q** ≤ 200

1 ≤ **H _{i}** ≤ 200

0 ≤

1 ≤ **N** ≤ 4

1 ≤ **N** ≤ 100

Input |
Output |

2 20 40 3 100 100 20 100 60 100 20 60 3 80 100 80 200 120 300 |
Case #1: 300 Case #2: 500 |