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:
[[83, 58], [1, -44, 39, 96, -139], [-177, -38, -191, -176, -173], [74, -94, -36], [-117, 29, -68, -191, 50, -102], [-73, -137], [51, -72], [85, -159], [-130, -191, -111, -94, -124, -199, -26]]
answer:
[83, 96, -38, 74, 50, -73, 51, 85, -26]


question:
[[-200, 67], [100, -189, 2, -76, -44, -120], [61, -38, -71], [-105, 50, -71, -145, -107, 43, -1], [-173, -90, 1, -146, -15], [95, -4, 38], [-27, -157, -141, 12, -171, -42], [22, 20, -170, -57], [-148, -178, -12, 92]]
answer:
[67, 100, 61, 50, 1, 95, 12, 22, 92]


question:
[[-103, -53, -88], [-6, 55, 71, -11, -156, 75, -32], [-51, -21, -112, -58, -121, -128, -39], [-62, -140, 32, -180, -52, -175], [-61, -56, -41], [-6, -196, 4, 71, -176]]
answer:

[-53, 75, -21, 32, -41, 71]