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: [[-191, 15, 11, -122, -8, -77, 51], [82, 28]]
Example Output: [51, 82]

Example Input: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]
Example Output: [79, -33, 2, 42, 81, -142, 71]

Example Input: [[98, 10, 86], [-72, 2, -29, -31, -125, -166], [-180, 63, -35, -20], [54, 42, 60, -89, -96], [-16, -187, -186, -76, 73, 29, 20], [-179, -76]]
Example Output:
[98, 2, 63, 60, 73, -76]