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]: [[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]
[EX A]: [-6, -59, 52, 14, 96, 37, 62]

[EX Q]: [[-92, 82], [-90, 37], [-135, -183], [-140, 37], [-156, -132, -162, -185], [28, 67, -110, -50, -53]]
[EX A]: [82, 37, -135, 37, -132, 67]

[EX Q]: [[-105, 17, 89, 67, 59], [36, -152, -144, -135], [-189, -33], [-13, 82, -21, -154], [-80, -107, -11, -177, 5], [58, -167, -147, 35, -10, -169], [63, -173, -146]]
[EX A]:
[89, 36, -33, 82, 5, 58, 63]