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, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]
[A]: [-55, 98, -27]


[Q]: [[70, -85, -168, -181, -49, -105], [-178, -54, -86, -113, -16], [1, 51, -127, -18], [-61, 80, -64], [-45, -175, -125], [-138, -96, -112, -14, -77, -188], [84, -96, 32, -165], [-125, -42, 88, 4, 60, -122, 89], [49, -84]]
[A]: [70, -16, 51, 80, -45, -14, 84, 89, 49]


[Q]: [[-182, -65, -114, -116], [-34, 12, -183], [96, -191], [-89, -44, 14, -128, 36, 43, -47], [-118, -30, 34, 16, -181], [66, 60, -191, 23, 34], [27, 43, -40, -47, 6, 26, -156]]
[A]:
[-65, 12, 96, 43, 34, 66, 43]