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]: [[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]
[EX A]: [100, 3, 97]

[EX Q]: [[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]
[EX A]: [79, 65, -87, 89, -2, -13, 20, -184]

[EX Q]: [[-5, -168, -161, -174, -10, -199, -38], [19, -7, -93, -86], [-194, -155, 21], [-57, 6, -59, -37, 86, -140, -127], [-169, 14, -167, -199], [-30, -105, -51, 71, -44, -162, 29], [-27, -5], [-76, -129, -33, -120, -43, 23]]
[EX A]:
[-5, 19, 21, 86, 14, 71, -5, 23]