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: [[-108, -104, -26, -89, -93, -182], [-98, -12, 74, -113], [-106, -170, -116, -138, -14, 56, -150], [-58, -175, -70, 0, -85, 71, -85]]

A: [-26, 74, 56, 71]
****
Q: [[-167, 11, 40, 64], [-136, -48, -90, 19, -124], [54, -157, 3, -24, -62, -92, 84], [-67, -110, -11, -111, 40], [-147, 78, -58]]

A: [64, 19, 84, 40, 78]
****
Q: [[-150, -111, -106], [-85, -103, -197], [-44, 66, 26, -103, 90], [-161, -16, -4, 84, -52], [44, -108, 5, -150, -113, 99], [-100, -63], [-106, 18, -46], [-161, -194]]

A:
[-106, -85, 90, 84, 99, -63, 18, -161]
****