def min_Ops(arr,n,k):
    max_val = max(arr)
    count = 0
    for x in arr:
        if (max_val - x) % k != 0:
            return -1
        count += (max_val - x) // k
    return count