**Compilation/Execution Result:**

Given a sorted array of distinct elements and an integer k. The array elements denote positions of points on 1-D number line, find the maximum size of subset of points that can have consecutive values of points which can be formed by placing another k points on the number line.

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of two lines. First line of each test case contains two integers N and K and the second line contains N space separated array elements.

**Output:**

For each test case, print the maximum size of subset containing consecutive values in new line.

**Constraints:**

1<=T<=200

1<=N<=10^{6}

1<=K<=10^{5}

1<=A[i]<=10^{6}

**Example:
Input:**

2

8 4

1 2 3 4 10 11 14 15

3 3

11 12 15

**Output:**

8

6

Author: arun03

dauntless | 84 |

rksingh | 74 |

iharshitmittal | 74 |

sj5331 | 69 |

madhumitha d rao | 66 |

Shashank_Pathak | 636 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 359 |

rksingh | 358 |

akhayrutdinov | 4159 |

sanjay05 | 3611 |

Quandray | 2829 |

Ibrahim Nash | 2501 |

Michael Riegger | 2296 |