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]: [[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]
[A]: [90, -4, 18]


[Q]: [[-44, -145, 83, -107, -25], [-86, 59, -176, 37, 50, 36, -129], [-22, 55, 65, 57, -9], [56, -191], [83, -160, 43], [-59, 76, -121, -152, 99, -87, 93], [-152, -119, 98, -89, -180], [-79, -11, 11, -44, 15, -180, -121], [24, -33, -179, -111, 82]]
[A]: [83, 59, 65, 56, 83, 99, 98, 15, 82]


[Q]: [[91, 36, -162, 44, -195], [60, -69, -79, -188], [-68, -98, -40, -114, 55], [-80, -152, -119], [-30, 4, -179, -124], [-48, -177, 28, -198, -11, 0, -161]]
[A]:
[91, 60, 55, -80, 4, 28]