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: [[83, -95, 37, -7], [33, -23, -133, -134, 77], [52, -161, 1, 34, -123, -29], [-130, 51, 97, -29], [-14, 36, -88, 49, -199]]

A: [83, 77, 52, 97, 49]
****
Q: [[-88, 39, 100, -118, -13], [-81, -150], [38, -64, -137, -74, -27, 84]]

A: [100, -81, 84]
****
Q: [[-45, 85, 0, -96, 8, -63, 95], [97, 28, -99, -156, 15], [-147, -4, -157, -84, 25], [-122, -169, -174, 82, -99], [-5, -76, -150, -86], [-83, -175, -51, -74, -135, -23, -146], [53, 38, -174, -22], [-186, -22, -22, 97], [-173, -198, -180, 66]]

A:
[95, 97, 25, 82, -5, -23, 53, 97, 66]
****