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:
[[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
answer:
[27, 65, -27, -9, -26, -33]


question:
[[-153, 77, 64, -116, -130], [-176, -137, -198], [22, -14, -129, 76, -76], [-15, -37, 92, -141, -51], [13, 89, -191, -24, -197], [-11, 30, -51, 61, 26, 7, -105], [-126, -126], [-178, -132, 98, -22, 77], [7, -190, 60, -51, 62]]
answer:
[77, -137, 76, 92, 89, 61, -126, 98, 62]


question:
[[-174, -200, -110], [-113, 96], [1, -149, -196, -118, -80, 98, -135], [-187, -101, -24, -134, -30, 93, -24]]
answer:

[-110, 96, 98, 93]