**Compilation/Execution Result:**

Given an array of positive integers, replace each element in the array such that the difference between adjacent elements in the array is less than or equal to a given target. We need to minimize the adjustment cost, that is the sum of differences between new and old values. We basically need to minimize ∑|A[i] – A_{new}[i]| where 0 <= i <= n-1, n is size of A[] and A_{new}[] is the array with adjacent difference less that or equal to target.

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains two integers N and K where N denotes the size of array A and K is the target.

The second line of each test case contains N space separated integers denoting elements of the array A[ ].

**Output:**

Print the minimum adjustment cost for each test case in a new line.

**Constraints:**

1<= T <=100

1<= N, K <=1000

1<= A[ ] <=100

**Example:**

**Input:**

4 1

1 3 0 3

**Output:**

3

Author: sujnesh

Rajat Thakur 2 | 251 |

surbhi_7 | 231 |

Anupam Prakash 1 | 215 |

Ibrahim Nash | 205 |

Vikram Sreenivasa | 175 |

Ibrahim Nash | 719 |

ashrepos | 578 |

shi143din | 438 |

RealHorror | 435 |

HABIB_SHEIKH | 369 |

akhayrutdinov | 4059 |

sanjay05 | 3451 |

Quandray | 2475 |

Michael Riegger | 2234 |

Jasleen Kaur 2 | 2012 |