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]: [[-77, 69], [35, -21, 65], [-182, -70], [-183, 51, -62, 34, -54, -137, 55], [46, -178, -122, -50, 32, -162, -132], [-9, -196, -1, -76, -36, 38]]
[EX A]: [69, 65, -70, 55, 46, 38]

[EX Q]: [[-106, 56, 90, 76, 6, -169], [-10, -187, 27, 59, 94, 85]]
[EX A]: [90, 94]

[EX Q]: [[-112, -167, -82, 28, 20, -45, -192], [54, 9, -91, 55, -51, 99], [45, 9, 89, -27, -64], [-82, -167, -18, -187, -144], [-121, -181, 25, 55, 24, -74, -114], [-8, 35, 57, -145, 88, 90, -100], [-172, -92, -94, -110], [14, 35, 53, 64, -196], [23, 80, 14, 77, -189]]
[EX A]:
[28, 99, 89, -18, 55, 90, -92, 64, 80]