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: [[-99, -133, 80, -160], [-10, -33, -172, 1, -182, -142, -140], [-105, -117, 58, 35, 83]]

A: [80, 1, 83]
****
Q: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]

A: [36, 69, 66, 79]
****
Q: [[-130, -20, -171, -122, 49, -43], [-173, -82, 17], [87, -55, -70, -113], [69, 10, -121, -177]]

A:
[49, 17, 87, 69]
****