In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
--------
Question: [[18, -24, 22, -153, 38], [34, 6, -5, 98, -168], [-137, -175, -142, 39, 10, -54, -95], [-127, -48, -200, 24], [-166, -170, -38, -121], [-60, 1]]

Answer: [38, 98, 39, 24, -38, 1]


Question: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]

Answer: [21, -38, 99, 89, 40, 46, 69]


Question: [[3, -102, -93], [3, -5, -89, -155], [-129, -148], [-158, -10], [-15, -88, 7], [79, 30, -146], [83, -110], [-161, -117, 86, -24, -3, 98]]

Answer:
[3, 3, -129, -10, 7, 79, 83, 98]