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:
[[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]
answer:
[27, -10, 40, 78, 74, 22, 51]


question:
[[57, 81, -73, 26], [-40, -99, 67, -180, 25], [75, 86, -116, 56, -141, -111], [-127, 59, -108, -86, -63, 24, -144], [-9, -161, 75, 26]]
answer:
[81, 67, 86, 59, 75]


question:
[[-82, 30, -178, -70], [-105, -54, -116, 28], [100, -66, 90, -90, -82], [55, -69, 17, -138], [-30, -147, -114, 39, -140]]
answer:

[30, 28, 100, 55, 39]