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]: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]
[A]: [58, 19, 68]


[Q]: [[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]
[A]: [35, -69, -81, 92, 91, 58, 48, -41]


[Q]: [[-49, -198, 50, -187, -120, -189, -144], [-27, 82, -117, 21, -90, -45, -79]]
[A]:
[50, 82]