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:
[[-123, -64, -37, -55], [-170, -193, 73, 94], [-21, -159, -100], [-59, -193, -156, 76], [21, -147, -140, -165, 85, -14], [-51, 57, 85, 1, -69, 93], [-156, -17, 72], [-48, -165, -96, -148, 5, -147], [-81, -55, 87, -12, -9]]
answer:
[-37, 94, -21, 76, 85, 93, 72, 5, 87]


question:
[[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]
answer:
[28, 70, 52, 63, -145, 11]


question:
[[-78, 47, -73, -28, -200, 9, -70], [-55, -1, -123, -181], [-173, 39, -75, -187, 10, -169, -99], [30, -155, -42, -143, -181, 34], [-13, -19, -177, -11, -20, -52]]
answer:

[47, -1, 39, 34, -11]