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: [[-60, -15, -145, -17, -184, -199], [-146, -105, 64, -192, -170, 17, 69]]
Example Output: [-15, 69]

Example Input: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]
Example Output: [49, 34, 10, 52, 78, 31, 30, 18]

Example Input: [[-192, 12, -131, 91, -38, -95, -61], [-5, -164], [-150, -118, -75, -81], [-135, 15, -48, -184]]
Example Output:
[91, -5, -75, 15]