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]: [[-154, -106, -158, 36, 91, -3, -98], [-49, -85, 23, 14, -170, -169, -170], [-177, -51, -192, -57, 64, 83, -173]]
[EX A]: [91, 23, 83]

[EX Q]: [[-58, 41, -14, -59, -168, -150, 61], [-110, -158, 28], [-109, 5, -79, -55, 95, -140], [8, -194, 9, -19, -121]]
[EX A]: [61, 28, 95, 9]

[EX Q]: [[49, -72, -46, 38, -96, 21], [21, -105], [47, -69, 13, -126], [-199, 49, -120, -36, 82, -141, -140], [-55, -74, 10, -34], [-129, -126, -197, -142, 21]]
[EX A]:
[49, 21, 47, 82, 10, 21]