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]: [[-191, 15, 11, -122, -8, -77, 51], [82, 28]]
[A]: [51, 82]


[Q]: [[-6, 83, -124, 9, -190, 76, -8], [48, -10, -88, -125], [5, -33, -85, 83, 31, 4, -125], [53, -95, 41], [-28, -75, -55, 35], [-103, -190]]
[A]: [83, 48, 83, 53, 35, -103]


[Q]: [[-127, 85, -19, 43, 43, 90], [-48, -56, 13, 64, 89, -41, -74], [-27, -6, -166], [31, -20, 99, -85, -15, -177, 9], [49, -49, -12, -164, 66], [-93, -23, 39]]
[A]:
[90, 89, -6, 99, 66, 39]