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: [[11, 10, -180, -124, -192, 98], [86, -172, -162]]
Example Output: [98, 86]

Example Input: [[-116, 8, -187, -74, -77], [-94, -11], [-145, -120, -47], [-178, -61, -91, -105, 24, 20], [61, -196, -157, -35, 35, -43, -195], [-193, -67], [-44, -22, -119, -11, -193], [70, -153, -120, 14, -140], [10, -170, -131, 6, -151]]
Example Output: [8, -11, -47, 24, 61, -67, -11, 70, 10]

Example Input: [[-9, -198, -109], [-166, -21, 6, -84, 97, -110, -22], [-102, -96], [-99, -152, 35, 78, -195, -117], [4, 13, -29, 61], [-111, -177], [-49, -103, 73, -41, 19]]
Example Output:
[-9, 97, -96, 78, 61, -111, 73]