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]: [[-28, -118, -156, -57, -161], [-29, -157, -63, 77]]
[A]: [-28, 77]


[Q]: [[4, -14, 13, -32, -16, -139], [-190, -70, 49], [-82, -106, 53, -194, -145, 90], [-24, 79, -78, -72, -38, -135], [-153, -110, 99], [60, -74, -133, -148], [90, 70, 100], [-115, -170, -72, -47, 85], [82, 79]]
[A]:
[13, 49, 90, 79, 99, 60, 100, 85, 82]