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]: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]
[A]: [12, -16, 41, 50]


[Q]: [[-45, -46, -14, 23, -167], [30, -95, 45, 99, -182], [43, -36, 11, 54, -39], [-165, -7, 29, -105, -125, -8], [56, -161, 54, 25, -146, -46, 98], [-189, -185, 82, -122, 59, 95, 38], [65, -34, -10, -33, -35, -125, -50], [-4, 88, -121, -118, 10], [41, -131, -189, -168, -198, -58, 51]]
[A]: [23, 99, 54, 29, 98, 95, 65, 88, 51]


[Q]: [[17, 20, 42, -126, -21], [-31, -181, -191, -21, 82, -87, -114], [-11, -73, -133, -60, 11, -77, -54], [77, 96, -87], [-117, -5, -14], [19, -148, -51], [76, -65, 94, -4, -80], [35, -190, -13, -89, -10, -177, -94]]
[A]:
[42, 82, 11, 96, -5, 19, 94, 35]