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]: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
[EX A]: [55, 64, 56, -31, -4, 51]

[EX Q]: [[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]
[EX A]: [63, -33, 43, 68]

[EX Q]: [[-191, 65, -184, -146], [-87, 81, -99, 58, -144, -15, 78], [-11, -56, -27], [79, -159, -135, -16, 33, -105], [-72, 88, -22, -97, -124], [-140, -146, 27, -151, -51, -152], [-156, -199, 29]]
[EX A]:
[65, 81, -11, 79, 88, 27, 29]