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.

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


[Q]: [[97, -79, -195, 1, -45, -140], [-172, -37, -72], [70, 17, 83, -49]]
[A]: [97, -37, 83]


[Q]: [[-54, 43, 14, 3, -181, 28], [-137, -54, -62, -1], [40, -168, -120, -195, 17, -9, 6], [-100, 36, 80], [-9, 30, 73, 32]]
[A]:
[43, -1, 40, 80, 73]