# 快速排序

# 时间复杂度 O(nlogn) 空间复杂度 O(logn)-O(n)

x = [int(i) for i in input().split(',')]

def kpsort(x, first, last):

font = first

end = last

middle = x[first]

应改为 middle = x[last]