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]: [[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]
[A]: [99, 54, 32]


[Q]: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]
[A]: [100, 84, -63, -55, 78, 58, 86, 99]


[Q]: [[-135, -167], [-193, -96, -92, -67, -33, 83, -95], [-137, -106], [-2, -35, -141], [-179, 98], [-135, -73, -84, -85, -160]]
[A]:
[-135, 83, -106, -2, 98, -73]