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]: [[80, -88, 28, 30, 69, 3], [55, -51, -83, 56, -134, 39, -32], [-66, -147, 46], [-169, 29, 6], [-140, 14, -116, -172, -85, -173, 3]]
[EX A]: [80, 56, 46, 29, 14]

[EX Q]: [[89, -153, 6, 22], [-170, -13, -120, -83], [20, -54, -193, -101], [7, 92], [-25, 100, -154, -30, -135], [13, -180, -117, -107], [6, -165, -63, -95, -197, -190, -113], [-92, -160, 88, 9, -185, -178, -36], [-154, -176, -126, -4, 71]]
[EX A]: [89, -13, 20, 92, 100, 13, 6, 88, 71]

[EX Q]: [[-20, -25, -124], [36, 36], [-8, -24, -172], [-169, -8, -125, -1, -192, -106, 67]]
[EX A]:
[-20, 36, -8, 67]