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]: [[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]
[A]: [12, -10, -48, -35]


[Q]: [[-21, -117, 34], [-98, -30], [-138, 37, -165], [31, 55, -180, -96], [-5, 85, -58], [-180, 61]]
[A]: [34, -30, 37, 55, 85, 61]


[Q]: [[-141, 32, -22, -28, -29, -119, 85], [-66, 21, -83]]
[A]:
[85, 21]