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]: [[-163, -129, -176, 12], [-28, -195, -125, -107, 23, 69], [-128, -129, -47, -30], [-53, -56, -32, -67, -7, -81, -156]]
[A]: [12, 69, -30, -7]


[Q]: [[-106, 56, 90, 76, 6, -169], [-10, -187, 27, 59, 94, 85]]
[A]: [90, 94]


[Q]: [[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]
[A]:
[12, -10, -48, -35]