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.

[EX Q]: [[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]
[EX A]: [99, 54, 32]

[EX Q]: [[-134, -121, 72, 82, -12, -28], [67, 87, 98, -58, -57, 6, 84], [-46, 76, -179, 21, -132, -46], [12, -67, -19, -46], [-62, -22, 58, -139, -39, -118], [-5, -170, 85, -75, -126, 53, -63], [9, -82, 7], [-88, -111, -81, 86, -17, 36, -160]]
[EX A]: [82, 98, 76, 12, 58, 85, 9, 86]

[EX Q]: [[-182, -138, -58, 30, -92], [75, -55, 0, 73, -37, 79], [62, -69, 45, 29, -170], [73, -122], [14, -12, 66, -74], [-138, -191, 40, 72, -134, -5], [-125, -78], [-172, -158, -194, -174]]
[EX A]:
[30, 79, 62, 73, 66, 72, -78, -158]