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:
[[70, -85, -168, -181, -49, -105], [-178, -54, -86, -113, -16], [1, 51, -127, -18], [-61, 80, -64], [-45, -175, -125], [-138, -96, -112, -14, -77, -188], [84, -96, 32, -165], [-125, -42, 88, 4, 60, -122, 89], [49, -84]]
answer:
[70, -16, 51, 80, -45, -14, 84, 89, 49]


question:
[[-31, -48], [7, -142, -76]]
answer:
[-31, 7]


question:
[[-51, -97, -78, 50, -31, -27], [59, 4, 79, 66], [19, 70, 99, -105, 76, -60], [-1, -187, -57, -95, -88], [19, -197]]
answer:

[50, 79, 99, -1, 19]