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: [[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]

Answer: [89, 96, -69, 40, 90, 75, 99, 98, 41]


Question: [[-149, -37, 36, -154, -65, 62, 57], [84, -123, 60, -42], [96, -160, -59, -77, 14]]

Answer: [62, 84, 96]


Question: [[38, -150, 99, -128, -36], [80, -59, -22, -139, -190, -159], [-148, -175, -47, -74, -99, -67, 6], [-184, 18, 47, -129], [-118, -21, -82, -35, -12], [-15, -21], [56, -118, -191, -157]]

Answer:
[99, 80, 6, 47, -12, -15, 56]