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]: [[-181, -160, -10, -6, -128], [78, -145, -191, -36]]
[A]: [-6, 78]


[Q]: [[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]
[A]: [99, 68, -32]


[Q]: [[-129, -48, -44, 83, -146, -151, -136], [54, -162, -171], [-195, 30, 44, -144, -144, -100, 42], [-194, -30, -88, 4, -3, -74, 86], [-132, 95, 57, -160, 11, 26, 16], [-181, 23, -68, -92], [-177, -102], [-84, -185, 1, -15]]
[A]:
[83, 54, 44, 86, 95, 23, -102, 1]