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: [[-108, -104, -26, -89, -93, -182], [-98, -12, 74, -113], [-106, -170, -116, -138, -14, 56, -150], [-58, -175, -70, 0, -85, 71, -85]]

Output: [-26, 74, 56, 71]


Input: Consider Input: [[-117, -110, 36, 18], [-15, 40, -140], [-33, 79, 8, 42, -4, 84]]

Output: [36, 40, 84]


Input: Consider Input: [[-135, 78, -156, -138, -120], [-147, 88, -96, -68, -179, -80], [-135, 98, -196, -119, 94], [11, 19, 98, -64, -57, -72, 36], [90, 40, 11, -78], [-190, 26]]


Output: [78, 88, 98, 98, 90, 26]