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: [[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]

Answer: [11, 41, 90, 72, 34, 56, 91, -133]


Question: [[-19, -186, -36], [-137, 15], [-194, -73, -48, -110, 24], [-3, -6, -4, 28, 84], [-195, -138], [76, -1]]

Answer: [-19, 15, 24, 84, -138, 76]


Question: [[-188, -122, -186], [-181, -29, -137, -112], [-146, 77, -102, -59, 42, -55, 62], [-64, 9, -42, -64], [67, 40], [-75, -55, -18], [91, -107, 59]]

Answer:
[-122, -29, 77, 9, 67, -18, 91]