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]: [[-97, -84], [-75, -51, 27, 64, -149, -46], [1, 62], [-8, -1, -122, -47], [-178, 88, 63, -49, -82, -1, -90], [-138, -192, -122, -71, -112]]
[EX A]: [-84, 64, 62, -1, 88, -71]

[EX Q]: [[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]
[EX A]: [19, -96, 60, 50, 63, 58, 92, 67]

[EX Q]: [[-97, -139, -189, -31, -88, 82], [-145, 69, -90, 93, -181, -93], [-27, 65, -76], [-144, 47]]
[EX A]:
[82, 93, 65, 47]