The Man who became a God 
Kars is tired and resentful of the narrow mindset of his village since they are content with staying where they are and are not trying to become the perfect life form. Being a top-notch inventor, Kars wishes to enhance his body and become the perfect life form. Unfortunately, $$$n$$$ of the villagers have become suspicious of his ideas. The $$$i$$$-th villager has a suspicion of $$$a_i$$$ on him. Individually each villager is scared of Kars, so they form into groups to be more powerful.The power of the group of villagers from $$$l$$$ to $$$r$$$ be defined as $$$f(l,r)$$$ where $$$$$$f(l,r) = |a_l - a_{l+1}| + |a_{l + 1} - a_{l + 2}| + \ldots + |a_{r-1} - a_r|.$$$$$$Here $$$|x-y|$$$ is the absolute value of $$$x-y$$$. A group with only one villager has a power of $$$0$$$.Kars wants to break the villagers into exactly $$$k$$$ contiguous subgroups so that the sum of their power is minimized. Formally, he must find $$$k - 1$$$ positive integers $$$1 \le r_1 < r_2 < \ldots < r_{k - 1} < n$$$ such that $$$f(1, r_1) + f(r_1 + 1, r_2) + \ldots + f(r_{k-1} + 1, n)$$$ is minimised. Help Kars in finding the minimum value of $$$f(1, r_1) + f(r_1 + 1, r_2) + \ldots + f(r_{k-1} + 1, n)$$$.
In the first test case, we will group the villagers with suspicion $$$(1,3,5,2)$$$ into $$$(1,3,5)$$$ and $$$(2)$$$. So, $$$f(1,3) + f(4,4) = (|1 - 3| + |3 - 5|) + 0 = 4 + 0 = 4$$$.In the second test case, we will group the villagers with suspicion $$$(1,9,12,4,7,2)$$$ into $$$(1),(9,12),(4,7,2)$$$. So, $$$f(1,1) + f(2,3) + f(4,6) = 0 + 3 + 8 = 11$$$.
The first line contains a single integer $$$t$$$ $$$(1 \leq t \leq 100)$$$ — the number of test cases. The description of test cases follows.The first line of each test case contains two integers $$$n,k$$$ $$$(1 \leq k \leq n \leq 100)$$$ — the number of villagers and the number of groups they must be split into.The second line of each test case contains $$$n$$$ integers $$$a_1,a_2, \ldots, a_n$$$ $$$(1 \leq a_i \leq 500)$$$ — the suspicion of each of the villagers.
For each test case, output a single integer — the minimum possible value of sum of power of all the groups i. e. the minimum possible value of $$$f(1,r_1) + f(r_1 + 1, r_2) + \ldots + f(r_{k-1} + 1, n)$$$.
def solve():
    (N, K) = map(int, input().split())
    a = list(map(int, input().split()))
    if N == 1:
        return 0
    ans = 0
    arr = []
    for i in range(1, N):
        arr.append(abs(a[i] - a[i - 1]))
        ans += arr[-1]
    arr.sort(reverse=True)
    for i in range(K - 1):
        ans -= arr[i]
    return ans
for tc in range(int(input())):
    print(solve())
nt = int(input())
ans = []
for i in range(nt):
    (a, b) = input().split()
    vs = list(map(int, input().split()))
    po = []
    for j in range(1, len(vs)):
        po.append(abs(vs[j] - vs[j - 1]))
    po.sort()
    ans.append(sum(po[:int(a) - int(b)]))
for i in ans:
    print(i)
def god():
    (l, j) = map(int, input().split())
    arr = list(map(int, input().split()))
    brr = [abs(arr[i] - arr[i - 1]) for i in range(1, l)]
    brr.sort()
    tmp = sum(brr[:l - j])
    print(tmp)
v = int(input())
while v != 0:
    god()
    v -= 1