class Solution:
def QSort(self,array,start,end):
if start<end:
i=start
j=end+1
K=array[start]
while i<j:
i=i+1
while array[i]<K and i<end:
i=i+1
j=j-1
while array[j]>K and j>start:
j=j-1
if i<j:
a=array[i]
array[i]=array[j]
array[j]=a
b=array[start]
array[start]=array[j]
array[j]=b
self.QSort(array,start,j-1)
self.QSort(array,j+1,end)
return array
if __name__ == '__main__':
s=Solution()
result = s.QSort([2,0,2,1,1,0],0,5)
print(" ".join(str(i) for i in result))