instruction:
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.
question:
[[-122, -130], [-22, 85, 73, -35], [-134, -96, 30], [49, -68, -166], [-75, -193, -193], [68, 50, -166, -111, -65, 25], [-109, 72, 22, -170, -106, -32, 66]]
answer:
[-122, 85, 30, 49, -75, 68, 72]


question:
[[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]
answer:
[-33, 49, 37, -34, 92, 57, 19, 72, -92]


question:
[[-113, -141, -168], [-142, -157, -99, -95, -141, -161, -56], [74, -76, -95, -37], [-173, -132, -25, -124, 14, 90], [-4, -16], [-141, -56, -47, 34, -49], [-163, 96, -104]]
answer:

[-113, -56, 74, 90, -4, 34, 96]