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]: [[-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]: [[69, -92, -181, 13, 31, -185], [-14, -145, -116, 13, -132, 90, 0], [-188, -25, -182, -101, 14]]
[EX A]: [69, 90, 14]

[EX Q]: [[52, -127, -158, -85, 8, 81, 97], [-200, 87, 82, 74, -48, 62], [-167, -63, 71, 63, -95], [8, 51, -84, 76, -104], [0, 84, 20, -65], [-96, -132, -67], [-94, 54, 54, 58, -183, -198], [80, 21, -71, -90, 86, 7], [-62, 84, -142]]
[EX A]:
[97, 87, 71, 76, 84, -67, 58, 86, 84]