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]: [[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]
[EX A]: [-66, -6, 91, 69, -24, 72]

[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]: [[46, 77], [-42, -62, 6, -78, 16], [-67, -160, -13, -30], [-4, -163]]
[EX A]:
[77, 16, -13, -4]