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]: [[-4, -186, 89, 50, 100, 24], [-135, -17, -4, 79, -42, -145], [-196, -130], [82, 74], [-187, 7, -164, -163, -109], [90, 76, -16, 13, 6, 89], [-89, 46]]
[EX A]: [100, 79, -130, 82, 7, 90, 46]

[EX Q]: [[-181, -63], [-111, -172, -116, 83, -159, 18, -84], [69, -70, -6], [-157, 82, -52, 65, -181, -110, -105], [-192, -147, -81, 98, -190, -172], [51, 68, -62, -101], [-38, -97], [64, -33, -185, -196, -145, -69], [64, -192, -165, -21, -24, 77, 98]]
[EX A]:
[-63, 83, 69, 82, 98, 68, -38, 64, 98]