k kids seem to have visited your home for the festival. It seems like the kids
had all been fighting with each other, so you decided to keep them as far as
possible from each other. You had placed n chairs on the positive number line,
each at position x i , 1 ≤ i ≤ n. You can make the kids sit in any of the chairs.
Now you want to know the largest possible minimum distance between each kid.

-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow. 
- Each testcase contains two lines. First line contains two space separated integers n and k. Second line contains n space separated values, x1, x2, x3, … ,xn.

-----Output:-----
For each test case print the largest possible minimum distance.

-----Sample Input:-----
1

2 2

1 2    

-----Sample Output:-----
1  

-----Constraints-----
- $2 \leq n \leq 100000$
- $0 \leq xi \leq 10^9$
- $k \leq n $

Starter code:

Solutions:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]

def check(mid):
    pos = x[0]
    ct = 1
    for i in range(1,n):
        if x[i]-pos >= mid:
            pos = x[i]
            ct += 1
            if ct == k:
                return True
    return False

for _ in range(inp()):
    n,k = ip()
    x = ip()
    x.sort()
    ans = -1
    l,r = 1,x[-1]
    while l < r:
        mid = (l+r)//2
        if check(mid):
            ans = max(ans,mid)
            l = mid +1
        else:
            r = mid
    print(ans)