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: [[99, -101, -88, 15, -73], [38, -143, -93, 43, -104, 48], [-39, -90, 31], [-146, 49, -10, 77, -49, -177]]

Output: [99, 48, 31, 77]


Input: Consider Input: [[20, 65, 13, -95, -32, -125, -94], [-133, -105, -155], [20, 61, -12, 47], [71, 82, 50, -151, -30], [-1, 80, 98, 2, -145, -21, -67]]

Output: [65, -105, 61, 82, 98]


Input: Consider Input: [[-5, -147, 0], [53, -118, -38], [-52, 39, 73, -175, 86, 45, -80], [42, -143], [-110, -111, 0, -9, 95, 6, -21], [-57, -31, -76, 26, -108, 44, -89]]


Output: [0, 53, 86, 42, 95, 44]