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: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]
Example Output: [100, 84, -63, -55, 78, 58, 86, 99]

Example Input: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]
Example Output: [95, 57, -144, 66, 54, 52, 93, 100, 21]

Example Input: [[-187, -112], [-49, -98, 68, -161, 69, 35, -147], [-30, -193, -144, -87, -143, -187, -151], [55, -199], [-117, -76, -1], [-79, -168, 97, -112], [73, -29, -149, 18, 6, -41, 77], [-161, -142, -37, -84, -137, -33, 93]]
Example Output:
[-112, 69, -30, 55, -1, 97, 77, 93]