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]: [[-19, -31, -126], [-24, -137, -129], [-126, 93, -32, 79, -145, -152], [-200, -55], [-194, 52, -67, -77, 15, -186, -158], [92, 62, -44, 90, -168, 96, -193], [-22, -125]]
[EX A]: [-19, -24, 93, -55, 52, 96, -22]

[EX Q]: [[50, -128, 17, 76, -122, 50], [6, -23, -7, -120, 28, -26], [-16, -60, -152], [28, -111, 22, -26, -61, -141, -16], [-51, 74]]
[EX A]: [76, 28, -16, 28, 74]

[EX Q]: [[-46, -175, -97, -181, 14, -100], [-34, -73, 76, 20, -84]]
[EX A]:
[14, 76]