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: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]
Example Output: [98, 30, 96, 87, 96, 67, 53]

Example Input: [[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]
Example Output: [99, 32]

Example Input: [[-23, -53, 83, 18, 2, -44], [-186, -66, 30, -40], [-33, 5, 37, 60, -105, 57], [-80, 3, 6, -96, 13, 96], [97, -148, -192, -110, 99, 44, 96], [-183, -186, 20, -22], [70, -59, 9, -21], [-48, 77, -146, 63, -80, -180]]
Example Output:
[83, 30, 60, 96, 99, 20, 70, 77]