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: [[-9, -117, -15, 36, -62, 49, -87], [-169, 79, 48, 59, -122, -181, 2], [-162, 4, 8], [-86, 70, -185, -115, -70]]

Output: [49, 79, 8, 70]


Input: Consider Input: [[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]

Output: [60, 26, 61, 74, -28]


Input: Consider Input: [[-124, -43, -143], [-39, 7, -166, 4, -44, -56, 34], [87, -18], [-177, -186, -132], [-103, -50, -54, -131, -51], [-150, 38, -162, -162, 67, -56, -184]]


Output: [-43, 34, 87, -132, -50, 67]