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]: [[-54, -127, -178, -98], [7, 82, 69], [-159, -142, -82, -156, -100, 7], [-76, 88, -45, 41], [86, -169]]
[A]: [-54, 82, 7, 88, 86]


[Q]: [[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]
[A]: [-19, -112, 30, 59, 65, -7, -16, 86, 39]


[Q]: [[14, -111, -144, -99, 80, -146, -139], [-106, -181, 52, -11, -10], [93, 98, -6, 44, -38, 6, -89], [-191, 26, -62, -61, 74, 73], [26, -131, 70, -141], [-156, -74, -104, -193], [85, -17, -182], [-76, 17, 72, 69, -37, -27, 100], [-65, -104, -8, -41, 24, -193]]
[A]:
[80, 52, 98, 74, 70, -74, 85, 100, 24]