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]: [[-26, -102, -136], [-24, 31], [-27, -127, -134, -71], [94, -98], [-150, -182, 69, 59], [47, -49, -92], [-155, 55, -81, -194], [-8, -35]]
[A]: [-26, 31, -27, 94, 69, 47, 55, -8]


[Q]: [[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
[A]: [27, 65, -27, -9, -26, -33]


[Q]: [[-8, -140, 67, -81, -120, 55], [-175, -68, -103, -127, 37, 18], [-72, -147], [-73, 66, -38, 63], [-125, 60, 35, -124, -28, -75, 90], [-176, 42, -172, 54, 12, 47, 94], [73, -2], [-10, 18], [-76, -121, -124, 70, -146, 52]]
[A]:
[67, 37, -72, 66, 90, 94, 73, 18, 70]