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:
[[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]
answer:
[-111, 83, -8, 92, 55, 91, 70]


question:
[[-19, -186, -36], [-137, 15], [-194, -73, -48, -110, 24], [-3, -6, -4, 28, 84], [-195, -138], [76, -1]]
answer:
[-19, 15, 24, 84, -138, 76]


question:
[[-174, -60, 34, -127], [32, -124, -39, 100, -58, 31, 92], [-123, 79, 55, -141], [97, 29, 100]]
answer:

[34, 100, 79, 100]