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]: [[-15, 18, 88, 39, -96], [-65, -76, 85, 2, -58], [41, -103], [-15, -196, -94, 13], [-57, 25, -169, -18, 42, -114], [-131, -61, 20, 42, -92, -50], [-93, -35], [-22, -200, -74, 17, -67, -17]]
[EX A]: [88, 85, 41, 13, 42, 42, -35, 17]

[EX Q]: [[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]
[EX A]: [54, 44, 50, 12, 24, -28]

[EX Q]: [[-89, -145, -108, -112], [-39, -22, 10], [-19, -110, -78], [-126, -33, -127, 28, 82, 100], [-172, -78], [-148, -124, 52, -21, 72], [-47, -166, 70, -167, -105, -197], [-19, 93], [-104, -123, 49]]
[EX A]:
[-89, 10, -19, 100, -78, 72, 70, 93, 49]