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: [[-123, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]

Output: [-68, 30, 99, 15]


Input: Consider Input: [[-66, -108, -51, -41], [-113, 13], [-83, 43], [88, -114, 42, -103, -132, 68, 62], [-164, 15], [10, 32, -120, 32], [-132, -140, -73, 33], [-27, -174, 2, 57, -113]]

Output: [-41, 13, 43, 88, 15, 32, 33, 57]


Input: Consider Input: [[76, 48, 81, 60], [36, -183, -152, -28, 69, -39], [-88, -185, 12, 32, 25, 95, -169], [8, -120, -34, 44, 32, 53, 6]]


Output: [81, 69, 95, 53]