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]: [[77, 52], [-25, -37, 13, 77, 88, -15, -158], [60, 86, -7], [78, 7, -132], [99, -94, -185, -158], [34, -90, 83, -81], [-21, -63, -161, 47, 12, 95], [59, 29], [-45, -57, 96, -170, 76, -70]]
[EX A]: [77, 88, 86, 78, 99, 83, 95, 59, 96]

[EX Q]: [[-175, -121, -165, 71, 62, -92, 49], [-30, 6, 91, -43, 19, -165], [-18, -168], [19, 89, 38, -42], [-41, -48, 94, -184, -187], [-95, -11, 54], [12, -11, -111, 31]]
[EX A]:
[71, 91, -18, 89, 94, 54, 31]