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.

[Q]: [[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]]
[A]: [38, 98, 39, 24, -38, 1]


[Q]: [[-18, -29, 4, 70, -1, 66], [-63, -199], [-128, 88], [-80, -95, -40, 51, -97], [-55, -200, -186], [-103, -104, -9, -179, 93, -82, -129]]
[A]: [70, -63, 88, 51, -55, 93]


[Q]: [[-148, -170, -41, -22, -47, -65], [81, 100, -48, -78, 95, 94, -8], [-194, 42, -134], [-111, -114, -82, 39, -195], [-145, -39, 22, -45]]
[A]:
[-22, 100, 42, 39, 22]