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]: [[78, 3, -186, -60, -85, -7], [-3, -75, -30], [63, -19, -166], [-47, -88, 58], [-94, -36, -79], [-134, -2, 43, 87]]
[A]: [78, -3, 63, 58, -36, 87]


[Q]: [[96, -52, 68, -142], [-73, -61, -136, -199, 2], [-76, -160, -80, -125, -52, 19], [59, -116, -112, -40, -22], [-16, 43], [-187, 28, -125, -154, -93, -133, 38], [-46, -200, -124, -158]]
[A]: [96, 2, 19, 59, 43, 38, -46]


[Q]: [[-71, 98, -96], [44, -123, -46, -93], [21, -87, 6, -136], [-177, 77, -103, 64, 47, 68], [-59, -113], [74, 84, -55], [-92, 14, 95, -22, -9], [90, -9], [-172, 25, -149]]
[A]:
[98, 44, 21, 77, -59, 84, 95, 90, 25]