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:
[[-132, -99, 9, -38, -77], [-7, 12, -183], [-158, -194], [-166, -39], [-115, -89, -104, -80, -147], [73, -200], [51, -31], [-51, -166, 69, -131], [26, -61, 53]]
answer:
[9, 12, -158, -39, -80, 73, 51, 69, 53]


question:
[[-92, -7], [1, -45], [53, -66, 54, -79, 17, -157, -142], [-9, -143, 9, -59], [-14, -179, -102, -29, -37], [-122, -171, -56, 94], [14, -199], [-83, -87]]
answer:
[-7, 1, 54, 9, -14, 94, 14, -83]


question:
[[-79, 65, -90], [-135, 9, 85], [40, -32, -130], [98, -106, -91, -57, -153]]
answer:

[65, 85, 40, 98]