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: [[-54, 44, 83, -159], [-121, -81], [-49, -186], [61, -20], [97, -128], [0, -50, 29, -154, -159, 40, -68], [-30, 77, -132, -155, -1, -90]]

Answer: [83, -81, -49, 61, 97, 40, 77]


Question: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]

Answer: [36, 69, 66, 79]


Question: [[63, -23, -162, 20, -168, -92, -191], [94, 50, 57, 23, 100, 76, -115], [-77, 43, -1, -23, -160], [-151, -99, -178, -94, 0, 2], [25, 36, -194, -140, -7]]

Answer:
[63, 100, 43, 2, 36]