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]: [[7, 12], [-173, 15, -64, -64, -10, 54], [87, 73, -93, -48, -75, -135]]
[A]: [12, 54, 87]


[Q]: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]
[A]: [49, 34, 10, 52, 78, 31, 30, 18]


[Q]: [[61, 38, -69, 39], [86, -106, 37, -122, -77, -136], [-199, -52, -53, 55, 48, -168], [-100, 3], [1, 19, 30, 57, 6, -44, -87]]
[A]:
[61, 86, 55, 3, 57]