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: [[-19, -186, -36], [-137, 15], [-194, -73, -48, -110, 24], [-3, -6, -4, 28, 84], [-195, -138], [76, -1]]

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


Input: Consider Input: [[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]

Output: [53, 64, -34, 92, 22, 82, 85, 81, 43]


Input: Consider Input: [[-111, -150, -60], [-110, 65], [91, -20], [0, 3, -97], [-65, -130, -138, -189, 59], [-128, -194, -23, -48], [92, 16, -149, 96, -30, -34, 100], [-99, -6, 9], [65, -73, 1, -177, -192, 91, -34]]


Output: [-60, 65, 91, 3, 59, -23, 100, 9, 91]