nevermind i realized the issue with this approach i am so terrible at this. this doesnt work if the m integer is smaller

then i think you just sort an array and then while the smallest integer is smaller than the biggest you increment the smallest integers in the array with a for loop if the array is not smaller then the loop breaks

we add 1 to the counter and sort the array at the end of a while loop as well

i have no idea how to phrase any of this better i myself am probably on the same level of coding

heres the lump of python code that I THINK works:

t = int(input())  # num of iterations


def calc():
    c = 0
    a = list(map(int, input().split()))
    m = int(input())
    a.sort()

    while a[0] < a[len(a)-1]:

        a.sort()
        for i in range(m):
            if a[i] < a[len(a)-1]:
                a[i] = a[i] + 1
            else:
                break
        a.sort() # added this after posting and realizing that sometimes the first num in the array can be the same size as the last but not the other ones
        c = c + 1  # the loop that repeats while the smallest int is smaller than the biggest; we check if the value is smaller than the biggest and if it is, we increment it; we also add 1 to the counter each "while" repetition

    print(c)


for i in range(t):
    calc()

# i think this kinda works