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]: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]
[EX A]: [21, -38, 99, 89, 40, 46, 69]

[EX Q]: [[44, 37, -10, 4, -109, 87], [-62, -48, 51, -171, -162], [-41, 10, -49, -32, -116], [89, 100, -192, -33, -41, -17, -19], [86, 16], [-92, -131, 2, -25, 10, -84, -124], [-119, 77], [58, 23], [-103, -64, -166, 74]]
[EX A]: [87, 51, 10, 100, 86, 10, 77, 58, 74]

[EX Q]: [[-108, 99], [-180, -55, -126, -13, -178, -173], [45, -26], [-128, 86, -13, -162, 69], [-129, -86, -79, 79], [91, 27], [33, 30, -130, -169], [74, 33, 64]]
[EX A]:
[99, -13, 45, 86, 79, 91, 33, 74]