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: [[-14, -150, -93, 55, -98, 54, -132], [-132, -64, -152, -37, -15], [-130, -137, -25, -40, -15, -165, 19], [-45, -121, -64, 99, -19], [-158, -6, -199, 91, -106], [-149, -111, 85, -94, 43, -185, -23]]
Example Output: [55, -15, 19, 99, 91, 85]

Example Input: [[-192, -11, 93, -154], [-45, -182, 72, -137, -13], [0, 43, -33], [-13, -124], [-79, 77, -26], [-98, -9, -157, -48, -195, -23, -87]]
Example Output:
[93, 72, 43, -13, 77, -9]