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]: [[-139, -177], [-69, 92], [69, -10, -53, 2, -46, -139], [-78, -50, 16, 96, -177]]
[A]: [-139, 92, 69, 96]


[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]: [[-188, -90, -115, -135], [96, 55, 25, 11, -56, -91], [15, 45, 74], [-79, -34, 94], [98, -120, -86], [-8, 40, -95, 2, 73], [34, -141, -13, -128, 25, 8]]
[A]:
[-90, 96, 74, 94, 98, 73, 34]