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: [[20, 65, 13, -95, -32, -125, -94], [-133, -105, -155], [20, 61, -12, 47], [71, 82, 50, -151, -30], [-1, 80, 98, 2, -145, -21, -67]]

Answer: [65, -105, 61, 82, 98]


Question: [[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]

Answer: [36, 86, 10, 81, 69, 41, 91, 34]


Question: [[-131, -158, -162, 31, -53, 41], [-146, -7], [85, -181, 72, -13, 64, -20, -63], [-162, 56, -100]]

Answer:
[41, -7, 85, 56]