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.

Example Input: [[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]
Example Output: [40, 84, 55]

Example Input: [[-92, -149], [-178, -95, 30, 90], [8, -122, -101, -194, -47, -192], [74, -174, -102, 37, -119, -102], [-135, -136, -126], [-186, -117, 6], [7, -114, -109, -31, -103, -61], [-147, -86, -163]]
Example Output: [-92, 90, 8, 74, -126, 6, 7, -86]

Example Input: [[97, -41, -157, -160, -157, -101, 10], [32, -60], [-81, -83, -76, -146], [-24, 72, -8, -161, 38, -121], [-111, -193], [-25, 96]]
Example Output:
[97, 32, -76, 72, -111, 96]