Geek has an array Arr, where Arr[i] (1-based indexing) denotes the number of chocolates corresponding to each station. When he move from station i to station i+1 he get A[i] – A[i+1] chocolates for free, if this number is negative, he looses that many chocolates also.

He can only move from station i to station i+1, if he has non-negative number of chocolates with him.

Given the cost of one chocolate is Rs. P, help geek to find the minimum cost incurred in reaching last station from the first station (station 1).

Note: Initially Geek has 0 chocolate.

**Input:**

The first line of the input contains an integer **T**, denoting the number of Test cases. Then **T**** **test case follows. The first line of each test case contains an integer **N**, denoting the total number of stations. Then next line contains **N **space separated integers denoting the elements of the array. The next line contains an integer **P **denoting the cost of a chocolate.

**Output:**

For each test case output a single line containing an integer denoting the total minimum cost ncurred in reaching last station from the first station.

**Constraints:**

1<=T<=10^{3}

1<=N<=10^{5}

0<=A[i]<=10^{5}

0<=P<=100

**Example:
Input:**

2

3

1 2 3

10

6

10 6 11 4 7 1

5

30

55

To reach the first station from the starting point, we need to buy 1 chocolate,

To reach station 2 form station 1, we get A[1] – A[2] = -1 chocolates i.e. we lose 1 chocolate. Hence, we need to buy 1 chocolate.

Similarly, we need to buy 1 chocolate to reach station 3 from station 2.

Ibrahim Nash | 107 |

aristotle | 79 |

Stark_Maverick | 77 |

shankyy | 73 |

Lam Ngoc Pham | 71 |

Lam Ngoc Pham | 476 |

All Is Well | 399 |

Prateek Gole | 385 |

Divvya Sinha | 374 |

Ibrahim Nash | 347 |

akhayrutdinov | 3868 |

sanjay05 | 3366 |

Michael Riegger | 2033 |

Jasleen Kaur 2 | 2012 |

Quandray | 1982 |