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]: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]
[A]: [-26, -3]


[Q]: [[-15, -180, -24], [-18, -77], [-167, -37, -37], [97, 80], [-91, 18, -122, -8, 90, -125, -162], [96, 74, -57, 89, -171], [66, -113]]
[A]: [-15, -18, -37, 97, 90, 96, 66]


[Q]: [[-28, -161, 42, -25, 16, 94], [63, -57, -172, -29], [12, -78, -192, -24], [21, -20, 14, 15, -93], [-13, -54, 37, 47], [-75, 11, 13, -49, 9, -85, -71], [40, 31, -163, -88, -130, -15, -84]]
[A]:
[94, 63, 12, 21, 47, 13, 40]