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: [[-138, -16, -188, -181, 86, -151], [56, -176, 31, -164, 39, 51]]

A: [86, 56]
****
Q: [[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]

A: [93, -100, 50, 56, 90, -87, 74, 82, 49]
****
Q: [[-121, 18, -98, -165], [64, -90, -196, -179, 73, -117], [-158, -96, -26, -149, -41], [-191, -51, -5, -157, 11, -185]]

A:
[18, 73, -26, 11]
****