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, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]

Output: [99, 68, -32]


Input: Consider Input: [[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]

Output: [78, 80, 91, 99]


Input: Consider Input: [[36, -7, 49, 11], [-55, 42], [32, -64], [92, -177, -152, 28], [36, -89, -15], [-173, -170, -121, -93], [42, -188, -129, -72, -200, 68], [37, 1, -104, 56, 5, -179], [-128, 59, -10]]


Output: [49, 42, 32, 92, 36, -93, 68, 56, 59]