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]: [[-170, -186, -15], [-130, -93, -50, 88, -170], [-15, -144, -141], [-85, -104, -115]]
[EX A]: [-15, 88, -15, -85]

[EX Q]: [[97, -79, -195, 1, -45, -140], [-172, -37, -72], [70, 17, 83, -49]]
[EX A]: [97, -37, 83]

[EX Q]: [[-51, -141, -55, 85], [36, -43, -189, 20, -62], [26, -165, -145], [-21, -106, 91, -77, 52, -144], [-156, -8, -64, -30, 32, 46], [56, -99, -195], [-42, -124, -15, 59, 22, 27, -94], [-147, -59, 51], [-155, -112, -76, 36, -86]]
[EX A]:
[85, 36, 26, 91, 46, 56, 59, 51, 36]