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]: [[97, -135, -83, -157, 30], [-24, 59, 42, -84, 64, -74], [6, 50, -174], [-170, 93, -66, -136]]
[A]: [97, 64, 50, 93]


[Q]: [[-99, -133, 80, -160], [-10, -33, -172, 1, -182, -142, -140], [-105, -117, 58, 35, 83]]
[A]: [80, 1, 83]


[Q]: [[-11, 69, -172, -48, 46, -51], [-200, -172], [12, -140, -155, -122, -190, -92], [-31, 56, -161], [-186, -67, -66, 0, 66, -168, 16], [-7, -21, -67, -44, -159, -148, 63], [-107, 95, -16, -180, 10, -157], [-139, -7, -154, -196, 81, -193], [-40, -83, -46, -180, -54, 56, -128]]
[A]:
[69, -172, 12, 56, 66, 63, 95, 81, 56]