A thief trying to escape from a jail has to cross N walls each with varying heights. He climbs X feet every time. But, due to the slippery nature of those walls, every times he slips back by Y feet. Now the task is to calculate the total number of jumps required to cross all walls and escape from the jail.

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains two space separated integers X, Y, N. Then in the next line are N space separated values denoting the heights ( Ht[] ) of the walls.

**Output:**

For each test case in a new line print the total number of jumps.

**Constraints:**

1<=T<=100

1<= N, X, Y <=100

1<= Ht[] <=1000

**Example:
Input:**

2

10 1 1

5

4 1 5

6 9 11 4 5

1

12

All Is Well | 138 |

ioan | 123 |

praveen2809 | 106 |

Diplav Srivastava | 100 |

user2100 | 90 |

Lam Ngoc Pham | 405 |

Divvya Sinha | 352 |

All Is Well | 327 |

skull tone | 310 |

KM SUNITA | 301 |

akhayrutdinov | 3792 |

sanjay05 | 3366 |

Jasleen Kaur 2 | 2012 |

Michael Riegger | 1996 |

Quandray | 1923 |