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]: [[-109, -49, -71, -4], [37, 18, -37, -47, 21, 0, -43], [90, -154], [33, 60, -7, -153], [-46, 9, 52, -84, 30, 55], [53, 14], [83, 72, 56, -46]]
[EX A]: [-4, 37, 90, 60, 55, 53, 83]

[EX Q]: [[91, -30, -165, -83, -18, 16], [-187, -77, -17, -151, -93, -151], [-135, -172, 18, 64, -60, 7, -119], [-189, 38, 81, 6, -68, -147, -36], [54, -171], [-139, 100, 28, -55, 52, 21, 82]]
[EX A]: [91, -17, 64, 81, 54, 100]

[EX Q]: [[22, -68, -161, 82, -29, -119, -27], [-10, 70, 21, 6, -84, 63], [-109, -111, -170, -72, -63, 28], [-169, -78, -37], [-12, -116, 68, 49, -65], [-130, 27, -111, -157, -38], [-142, -12, -105]]
[EX A]:
[82, 70, 28, -37, 68, 27, -12]