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: [[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]

Output: [99, 32]


Input: Consider Input: [[-9, -117, -15, 36, -62, 49, -87], [-169, 79, 48, 59, -122, -181, 2], [-162, 4, 8], [-86, 70, -185, -115, -70]]

Output: [49, 79, 8, 70]


Input: Consider Input: [[77, -151, -49, -179, -53, -29], [-110, -55, -99, -75, 61], [-14, 85, 45, -88, -160, -91, -121], [-91, 45, -47, 13, -166], [70, -194, -168, 54], [61, -79], [81, -171, 47, 51, 45], [-178, 29, -92, -117]]


Output: [77, 61, 85, 45, 70, 61, 81, 29]