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: [[-150, 80, -128, -124], [-179, 83, -152, 11, -187, -1, -81], [88, -154, -20], [-59, -40, -39, -188], [-8, -53, 29, -181, 77], [-69, -7, 60, 22, -121], [-51, -96, -16, -120], [-79, 93, -86, -16, -96, -74, -187], [-39, -195, 86, 32]]
Example Output: [80, 83, 88, -39, 77, 60, -16, 93, 86]

Example Input: [[-71, 36, -5, -120, -126, -66, 34], [-79, -77, 14], [-192, -7, 34, -110], [-162, -69, -117, 17, -56, 15], [-142, -149, -38, 84, 94]]
Example Output:
[36, 14, 34, 17, 94]