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: [[89, -153, 6, 22], [-170, -13, -120, -83], [20, -54, -193, -101], [7, 92], [-25, 100, -154, -30, -135], [13, -180, -117, -107], [6, -165, -63, -95, -197, -190, -113], [-92, -160, 88, 9, -185, -178, -36], [-154, -176, -126, -4, 71]]

Output: [89, -13, 20, 92, 100, 13, 6, 88, 71]


Input: Consider Input: [[99, 11, 61, -95], [-186, -124, -20, -125], [-50, 93, -17], [-165, 56, 52, -142], [-88, -46, -178, -37, -126, 24], [84, 100, 18, 71, -135, 44, 96]]

Output: [99, -20, 93, 56, 24, 100]


Input: Consider Input: [[11, 28, -75, 69, -198], [90, -156, -145, 37, 28, -123], [-53, 38, -186, -103], [1, -76, -27, 35, 18, -173], [-190, -144, 48, -61], [-133, -190, -78, -192, -7, -111]]


Output: [69, 90, 38, 35, 48, -7]