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]: [[14, -64, 78], [-36, -133], [-17, 49, -19, -14], [-140, -55, 35]]
[A]: [78, -36, 49, 35]


[Q]: [[-75, -110, -13, -96, 22], [-199, -154, 9], [-80, -160], [-90, 65, -167, -77, -28]]
[A]: [22, 9, -80, 65]


[Q]: [[-58, 44, -56, -127, -41, 0, -161], [-140, -113], [73, -101, -105, 31, -73, 76, 47], [-178, 24]]
[A]:
[44, -113, 76, 24]