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: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
Example Output: [60, -32, 68, 93, 24, 26, 7, 85]

Example Input: [[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]
Example Output: [52, 80, 98, 38, 69, 81, 8, 64]

Example Input: [[-130, -59], [-111, 56, -183, -176], [97, -11, 75], [-54, 88, -80, 30, 64]]
Example Output:
[-59, 56, 97, 88]