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.

Input: Consider Input: [[-99, -20, 1, -195], [47, -92, -16, 34, -113, 62, 3], [-200, -20, -92, 100], [-27, -94, 26, -53, -67], [-73, -16, -70, 12, 85, -173, -193], [-183, -64, -9, 56, -73, -21, -76], [-69, -9, -193, -108, -97]]

Output: [1, 62, 100, 26, 85, 56, -9]


Input: Consider Input: [[-77, 69], [35, -21, 65], [-182, -70], [-183, 51, -62, 34, -54, -137, 55], [46, -178, -122, -50, 32, -162, -132], [-9, -196, -1, -76, -36, 38]]

Output: [69, 65, -70, 55, 46, 38]


Input: Consider Input: [[-117, 71, -49, 27], [-151, 82], [-185, -70, -111, -34, 56], [-141, -120, -167], [-106, 15, -83, -122, 11, -118], [-14, -1, -86, -134, -111, -60, 89], [-61, 40, 19]]


Output: [71, 82, 56, -120, 15, 89, 40]