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]: [[-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]: [[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]
[A]: [48, -87, 96, 54, 91, 58, -23]


[Q]: [[-90, -73], [17, -106, -127], [-10, 69, -179, -155, -111, -199, -60], [-125, -18, 5], [55, 88, 19, -78, -124, -90, 50]]
[A]:
[-73, 17, 69, 5, 88]