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: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

A: [2, 72, 60]
****
Q: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]

A: [83, 79, 34, 49, 11, 75, -6, 67, -96]
****
Q: [[-102, -33, 21, 55, -15], [-53, -165, -199, 86, -160], [-39, -106, -160, -2, 69, 77, -178], [65, -13, -196, 8, -189, -27, 18], [93, -32, -166, 21]]

A:
[55, 86, 77, 65, 93]
****