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: [[5, 3], [2, 9, 8], [3, 3], [5, 2, 7, 1]]
Example solution: [5, 9, 3, 7]
Example explanation: Input of this example is a list containing four inner lists. The maximum value of the first inner list is 5, the maximum value of the second list is 9, the maximum value of the third list is 3, and the maximum value of the fourth list is 7. So the output should be [5, 9, 3, 7], and this is a good example.

Problem: [[-20, -71, 6, -138, -187, -81, -191], [-157, -134, -87, -121, -73, 46, -152], [-96, -45], [-63, -12, 26, -139, -8, -198], [-135, -30, -142, -10], [-101, 16, -196, -162, -58], [93, -36, -155], [-41, 21, 38, -57, -173, -104], [-16, 53, -160]]

Solution: [6, 46, -45, 26, -10, 16, 93, 38, 53]