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:
[[-194, -52, 35, -70], [-101, -197]]
answer:
[35, -101]


question:
[[75, -154, -179, -44], [-46, 5, -27, -68, -112], [-200, 64, 56, -97, -109, -152, 96], [-129, -77, 58, -70], [29, 93, -138, -195, -141, 72, -181], [-133, -49, -200], [-5, -144, -95, -91, -99], [82, -69], [-195, -120, -86, -177, 30, 22, 92]]
answer:
[75, 5, 96, 58, 93, -49, -5, 82, 92]


question:
[[30, -5, 49, -64, -57, -165], [-59, -141, -119, 32, -100], [72, -38], [-140, -102], [-48, -181, -100, 12, -175]]
answer:

[49, 32, 72, -102, 12]