def obr(l): 

 if l[0] == sorted(l[0]): 

 return l 

 for i in range(len(l[0]) - 1): 

 for n in range(len(l[0]) - i - 1): 

 if l[0][n] > l[0][n + 1]: 

 for i in range(len(l)): 

 l[i][n], l[i][n + 1] = l[i][n + 1], l[i][n] 

 return l 

l = [[2, 3, 1, 4], 

 [4, 5, 6, 10], 

 [7, 8, 9, 22]] 

print(obr(l))