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: [[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]

A: [98, 79, 97, 65, 71, 43, -72]
****
Q: [[-3, -50, 28, 67, -12, 97, -98], [41, 88, 81], [44, -50, -49, -132, -161, 26]]

A: [97, 88, 44]
****
Q: [[-159, -15, -92, 63, -12, 13], [-145, -113], [38, -66, -184, 83, -4, -69, -73], [83, -167, -54]]

A:
[63, -113, 83, 83]
****