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: [[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]

Output: [82, -35, 37, 86, 1, 46, 99]


Input: Consider Input: [[78, -179], [-154, 26, -194, -39], [73, -154, 7, -158, 45]]

Output: [78, 26, 73]


Input: Consider Input: [[-102, -81, 30], [47, 54, -2, 91, -16, 44], [77, -165, 68, 93, -45], [-9, -99, 54, -30, -170, 58], [-113, -142, 71, 17, 42, -193, 47], [2, 56, 55, 47, -58]]


Output: [30, 91, 93, 58, 71, 56]