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: [[-75, -110, -13, -96, 22], [-199, -154, 9], [-80, -160], [-90, 65, -167, -77, -28]]

A: [22, 9, -80, 65]
****
Q: [[-18, 44, 37, -24], [-56, -127, -121, -102, -189, -43, -175], [-108, -188, 93, -46, -6], [4, -164, 23, 16], [-179, 9, -58]]

A: [44, -43, 93, 23, 9]
****
Q: [[-87, 53], [-73, -193], [97, -118, -44, 32, 45, 42], [-23, 12], [80, -135, -121, -183, -104, -45], [38, -89, -114, 61]]

A:
[53, -73, 97, 12, 80, 61]
****