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: [[75, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]
Example Output: [75, 95, 70, 68, 100, -2, 15, 32, 97]

Example Input: [[76, -185, 14, -102], [15, 67, 90, -188, -10], [88, -45, -12, 30, 90, -18], [-131, 47, -43, 0, -134], [-105, 94, 29, 2], [63, -152, -158, 92, -27, -147, -115]]
Example Output: [76, 90, 90, 47, 94, 92]

Example Input: [[-198, -161], [66, 7, 92, 36, -103, -44], [-121, 33, 33, -183, 81, -87, 6], [-125, 1, -186]]
Example Output:
[-161, 92, 81, 1]