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: [[77, 52], [-25, -37, 13, 77, 88, -15, -158], [60, 86, -7], [78, 7, -132], [99, -94, -185, -158], [34, -90, 83, -81], [-21, -63, -161, 47, 12, 95], [59, 29], [-45, -57, 96, -170, 76, -70]]

Output: [77, 88, 86, 78, 99, 83, 95, 59, 96]


Input: Consider Input: [[-18, -153, 98, -195], [-154, -184, -85, -25, -121, -55], [-153, -57, -109, 42], [-101, -163], [76, 11, -100, -160, 62, -181, -1], [88, 92, 83, -44, -164], [-11, -91, 82, -166, -126, -22], [53, -186, -21, 25, -191, -100], [44, 30, -195, -56, 53, -183]]

Output: [98, -25, 42, -101, 76, 92, 82, 53, 53]


Input: Consider Input: [[-111, -156, -178, -9, 39], [68, -59, -38], [-179, -111, -52]]


Output: [39, 68, -52]


