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]: [[-138, 71, -27, -83], [-80, -136, 28, 70], [33, -23, -79, -51, -127]]
[A]: [71, 70, 33]


[Q]: [[-154, -106, -158, 36, 91, -3, -98], [-49, -85, 23, 14, -170, -169, -170], [-177, -51, -192, -57, 64, 83, -173]]
[A]: [91, 23, 83]


[Q]: [[40, -192, -8, 84, -150, 82], [-79, -154, -75, -67], [-136, 39, -87], [96, -113], [-26, -135, -60, -74, -112, 56], [-92, -194, -45], [-86, -167, 75, 81, -133, 79, 68], [87, -187]]
[A]:
[84, -67, 39, 96, 56, -45, 81, 87]


