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: [[-106, -107, 85, 70, 87, -119, -149], [-41, -103]]
Example Output: [87, -41]

Example Input: [[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]
Example Output: [11, 41, 90, 72, 34, 56, 91, -133]

Example Input: [[41, 10, 63], [-162, 50, -147, -65, 81, -75, -87], [-141, -199, -151, 93, 81, -159], [-34, 60, -83], [-52, -142, -73, -96, -189, 1, -78], [-2, -92, -196, -26, -127, 24], [-128, -190, -149, 78, -60, 82], [-101, -40, -101, -16], [-132, -139, -39, 44, 83, -23]]
Example Output:
[63, 81, 93, 60, 1, 24, 82, -16, 83]