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]: [[-181, -180, 67, -144, 81], [-111, -185, -90, -148], [-57, 8, -160, -124, -144], [-127, 69, -3, -93, -101], [57, -173, 91, -38], [-75, -50, 8, 83]]
[EX A]: [81, -90, 8, 69, 91, 83]

[EX Q]: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]
[EX A]: [91, 53, 82, -9]

[EX Q]: [[35, -101, 13, 4, -151, 87], [50, 52, -34, -161], [-184, -19, -4, -152], [82, 30, -168, -115, -193, -139], [12, -97, -193]]
[EX A]:
[87, 52, -4, 82, 12]