def main(): import sys input = sys.stdin.read data = input().split() idx = 0 N = int(data[idx]) idx += 1 K = int(data[idx]) idx += 1 if K == 0: print(0) return p = list(map(int, data[idx:idx+N])) idx += N B = list(map(int, data[idx:idx+N])) current = p.copy() sum_dist = 0 for i in range(N): sum_dist += abs(current[i] - B[i]) total = sum_dist remaining = K - 1 while remaining > 0: # Find the largest i such that current[i] < current[i+1] i = N - 2 while i >= 0 and current[i] >= current[i+1]: i -= 1 if i == -1: # current is the last permutation, wrap around to the first for j in range(N): sum_dist -= abs(current[j] - B[j]) current[j] = j + 1 sum_dist += abs(current[j] - B[j]) total += sum_dist remaining -= 1 continue # Find the largest j > i such that current[j] > current[i] j = N - 1 while current[j] <= current[i]: j -= 1 # Swap current[i] and current[j] sum_dist -= abs(current[i] - B[i]) sum_dist -= abs(current[j] - B[j]) current[i], current[j] = current[j], current[i] sum_dist += abs(current[i] - B[i]) sum_dist += abs(current[j] - B[j]) # Reverse current[i+1:] # Calculate the old contribution and update sum_dist left = i + 1 right = N - 1 while left < right: sum_dist -= abs(current[left] - B[left]) sum_dist -= abs(current[right] - B[right]) current[left], current[right] = current[right], current[left] sum_dist += abs(current[left] - B[left]) sum_dist += abs(current[right] - B[right]) left += 1 right -= 1 total += sum_dist remaining -= 1 print(total) if __name__ == "__main__": main()