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]: [[-192, -183, 27, -64, -73, 59, -30], [-127, -95, 61, -80], [-129, -43, -148, 74]]
[A]: [59, 61, 74]


[Q]: [[84, -86, 87, -13, 3, -132, 58], [41, -141, -89], [45, 53, 6, -87]]
[A]: [87, 41, 53]


[Q]: [[27, 97, -15, -5, 30, 53], [2, -86, -24, -114], [-133, -51], [11, -189, 24, -187, 21, -175], [-105, 38, -30, 93], [-68, -127, -158, 28], [-171, -173, 55, -120], [-30, 41, -196, -8, -26], [-193, 23, 69, 81, -76]]
[A]:
[97, 2, -51, 24, 93, 28, 55, 41, 81]