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: [[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]

Output: [85, 82, 95, -111, 24, -112, 65, 65, 16]


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: [[-66, -86, 6, -14], [4, 67, -113], [-131, 82, -155, 96, -59], [-57, 38, -140], [-92, -27, 68, -25, 18], [-113, -184]]


Output: [6, 67, 96, 38, 68, -113]