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: [[-92, 82], [-90, 37], [-135, -183], [-140, 37], [-156, -132, -162, -185], [28, 67, -110, -50, -53]]

Output: [82, 37, -135, 37, -132, 67]


Input: Consider Input: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]

Output: [79, -33, 2, 42, 81, -142, 71]


Input: Consider Input: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]


Output: [58, 19, 68]