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]: [[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]
[A]: [28, 70, 52, 63, -145, 11]


[Q]: [[-129, -163, 91, 74, -11, -30, -197], [-55, -146, 3, -187], [31, -111, 49, -80], [-6, -162, 70, -24, -150], [46, 61, -2, 91, 5]]
[A]: [91, 3, 49, 70, 91]


[Q]: [[38, 79, -119, 10, -199], [-175, 94, 77, 44, 59, 79, -114], [-70, -13], [-16, -35, -189]]
[A]:
[79, 94, -13, -16]