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: [[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]

Answer: [-105, 97, 59, 80, -47, -51, 9, 70, 81]


Question: [[-200, -149], [17, -98, -83, -176, -23, -84], [-187, -199, 77], [-152, 46, -37, -153], [47, 21, -16, 72, -132, -85, 51], [-132, 39, 87, -66, -141, 5, -93]]

Answer:
[-149, 17, 77, 46, 72, 87]