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: [[73, -86, -24, -107, 43], [-26, -60, -75, -9, -165], [-134, 87, 97], [100, -87, -94, -163, -189, 87, 85]]

A: [73, -9, 97, 100]
****
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: [[-88, -73, 65, 51, -100], [-75, -195], [-115, 4, -152, -151, -65, 95, 85]]

A:
[65, -75, 95]
****