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]: [[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]
[A]: [-57, 95, 65, -1, 100, 55, 31, 94]


[Q]: [[95, -34, -73, 46, 51, -185, -192], [-43, -56, -90, -52], [59, 91], [90, 18, 33, -33, -62, -52]]
[A]: [95, -43, 91, 90]


[Q]: [[-15, 85, 65, -145, -87], [-70, -92], [-196, -101, -110, 64, -78], [-109, -130, 19, -185, -200, -27]]
[A]:
[85, -70, 64, 19]