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]: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
[A]: [55, 64, 56, -31, -4, 51]


[Q]: [[-15, 93, -70, -39], [-157, -29, 74, -14, -155], [74, -176, -85, -143, 4, 0, -25]]
[A]: [93, 74, 74]


[Q]: [[26, 0, -164, -132, 74], [-182, -126, 37, 45, -52, 92, -101], [-100, -174, -54, 92, -192, -136, 57], [-166, -96, 49], [-152, 3], [-26, 69, -52, -114, -183, 26, 30], [96, -61, -175, -184, 74, 16, 9], [80, -71, -199, 60, -158, -159], [-193, -113, -78, -81]]
[A]:
[74, 92, 92, 49, 3, 69, 96, 80, -78]