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]: [[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]
[EX A]: [25, 59, -59, 90, 68, -84]

[EX Q]: [[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]
[EX A]: [47, 58, 99, -57, 92, -77, 30, 0, -38]

[EX Q]: [[61, -64, 30, 54, -154], [95, -77, 30], [-64, -101, -57, -150, -153, 87, -65], [80, 66], [8, -108], [-67, -74], [-98, -46, 15, 61, 78], [22, -64, 72, 37, -177], [91, -42, 16]]
[EX A]:
[61, 95, 87, 80, 8, -67, 78, 72, 91]