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: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]

Answer: [45, 33, 26, 69, 89, 95, 57, -4]


Question: [[-6, 41, -190], [-47, 89], [29, -17, -135]]

Answer: [41, 89, 29]


Question: [[-149, 13, 85, 50, 53], [-71, -32, 42, -133], [-34, -140, -127, -92, 24, -63], [-2, 47, -21, -94, 73, -39], [-128, -198, 93, -3], [-200, -123, -126], [-124, -128, 8, 84], [7, -175], [-49, -196, -191]]

Answer:
[85, 42, 24, 73, 93, -123, 84, 7, -49]