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: [[-103, 16, -53, -29, -31, -137, -190], [-87, -195, -34, 13], [97, -68], [-67, 8, -100, -197, 19], [-76, 36, 24, -166, 20, 11], [-173, 10], [60, 8, -56]]
Example Output: [16, 13, 97, 19, 36, 10, 60]

Example Input: [[83, 58], [1, -44, 39, 96, -139], [-177, -38, -191, -176, -173], [74, -94, -36], [-117, 29, -68, -191, 50, -102], [-73, -137], [51, -72], [85, -159], [-130, -191, -111, -94, -124, -199, -26]]
Example Output: [83, 96, -38, 74, 50, -73, 51, 85, -26]

Example Input: [[-122, -128, -184, -60, -9], [-28, -64, -3, -52, 2, 42, 47], [32, -52, 42, 56, -3, -72], [-130, 40, -159, -180, -20]]
Example Output:
[-9, 47, 56, 40]