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: [[6, -22, -195, 87], [-198, 60, 87, 19, 98, -147, 94], [-62, 50], [-159, -118, -193], [-165, -176, -157, -43, -121, -73], [32, 51, -24, -37, 80], [-110, -100, -198, -145]]
Example Output: [87, 98, 50, -118, -43, 80, -100]

Example Input: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]
Example Output: [-7, 91, 93, 86, 39, -35, 74, 72, 17]

Example Input: [[-168, -67], [-135, 7, 22], [-147, -58, 86, 24, -123, -141, -57], [-86, 7, -200], [51, 67, 10]]
Example Output:
[-67, 22, 86, 7, 67]