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]: [[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]
[A]: [-3, 50, -38, 51, 42, 54, 81, 76]


[Q]: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]
[A]: [91, 53, 82, -9]


[Q]: [[-194, -144, -120], [-121, 93, -87, 7, 83], [-73, -82]]
[A]:
[-120, 93, -73]