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]: [[-88, -73, 65, 51, -100], [-75, -195], [-115, 4, -152, -151, -65, 95, 85]]
[A]: [65, -75, 95]


[Q]: [[-133, -65, -46, -65, -104, -121], [-134, -123], [-109, -102], [74, -87, 93], [-16, -73, 67, -128, 9]]
[A]:
[-46, -123, -102, 93, 67]