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]: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]
[A]: [12, -16, 41, 50]


[Q]: [[-73, 76, -100, -143], [-74, -141], [73, -82, -103, -88, 70, -159, -124], [-110, -78, 44, 57, -61], [41, -83, -173, -44, -181]]
[A]: [76, -74, 73, 57, 41]


[Q]: [[-76, 86, -143, 11, 48, 84], [82, -12, -90], [-174, -49, -68]]
[A]:
[86, 82, -49]