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: [[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]

Output: [90, 65, 16, 93, 30]


Input: Consider Input: [[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]

Output: [93, 68, 96, 94, 81, 71]


Input: Consider Input: [[-49, -12], [-172, 49], [-200, 56, -24], [-166, 98, -193, -130, -140, 7, -51], [84, -37, 59], [-65, 60, -47, 94], [-100, 84, 85, 79, -6], [92, -197, -39, 87, -126], [30, -176, 87, -46, 45, -58, -150]]


Output: [-12, 49, 56, 98, 84, 94, 85, 92, 87]