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]: [[35, -101, 13, 4, -151, 87], [50, 52, -34, -161], [-184, -19, -4, -152], [82, 30, -168, -115, -193, -139], [12, -97, -193]]
[EX A]: [87, 52, -4, 82, 12]

[EX Q]: [[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]
[EX A]: [53, 34, 91, 40]

[EX Q]: [[-164, -173, -73, -94, 87], [-158, -120], [90, -129, -176, -63, 16], [-144, -106, -16, 80, 95, -75, 8], [41, -48], [-154, 25, -184, -195], [-20, -160, -131, -124, 55]]
[EX A]:
[87, -120, 90, 95, 41, 25, 55]