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]: [[10, -182, -172, -154, 42, -42, -159], [10, -7, 32, -26], [-79, -77, -179], [57, 21, -139, -114, 23, -177, 24], [-122, 57, -110, 84], [42, -107, -190, -73, -184, -186]]
[A]: [42, 32, -77, 57, 84, 42]


[Q]: [[35, -101, 13, 4, -151, 87], [50, 52, -34, -161], [-184, -19, -4, -152], [82, 30, -168, -115, -193, -139], [12, -97, -193]]
[A]: [87, 52, -4, 82, 12]


[Q]: [[-151, 55, -28, -21, -38, 39, -158], [0, -148, 34, 81, 56, 41], [-69, 79, -72, -181, 78]]
[A]:
[55, 81, 79]