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: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]

Output: [17, 85, 20, 70, 12, 73, 90, 59, 58]


Input: Consider Input: [[-46, 14, -141, -77, -62], [-183, -86, -115], [-146, -60, 34], [-42, 19, -101, -49, 47], [-117, -174]]

Output: [14, -86, 34, 47, -117]


Input: Consider Input: [[88, 67, 40], [-84, -133, -51, -132, 32, 52], [-126, 12, -190, 40, -91, -37], [-199, -132, -196, -11], [-81, -115, 73], [-129, -24, -184, 45, -49, -13, 78]]


Output: [88, 52, 40, -11, 73, 78]