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: [[80, -88, 28, 30, 69, 3], [55, -51, -83, 56, -134, 39, -32], [-66, -147, 46], [-169, 29, 6], [-140, 14, -116, -172, -85, -173, 3]]
Example Output: [80, 56, 46, 29, 14]

Example Input: [[99, -101, -88, 15, -73], [38, -143, -93, 43, -104, 48], [-39, -90, 31], [-146, 49, -10, 77, -49, -177]]
Example Output: [99, 48, 31, 77]

Example Input: [[37, -1, 85, 95, 43, -90, -166], [51, -152, -176, -82, -192, 39, 6], [-173, -91], [-199, -93, -5, -184, -99], [-185, -134, -145], [-64, -11, -93, -179, 48, -156], [-21, -98, 49, -20, -154, 82]]
Example Output:
[95, 51, -91, -5, -134, 48, 82]