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, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]
Example Output: [98, 56, 93, 13, 28, 59, 74]

Example Input: [[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]
Example Output: [100, -120, -94, 63, 50, -139, 80, 56, 88]

Example Input: [[-58, -109, -171, -175, -143, -20], [-193, 49, 80, -146, -138], [4, 25, 16, -141, 62, -164], [-185, -87, -124, -197, -140, -141, -138], [-59, -14], [-188, 54, -56, 47, 79, -186, -188], [-60, 31, -141], [-197, -44, 71, -21], [-10, 84, -120, -56, 27, -52, -128]]
Example Output:
[-20, 80, 62, -87, -14, 79, 31, 71, 84]