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: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
Example Output: [55, 64, 56, -31, -4, 51]

Example Input: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]
Example Output: [-7, 91, 93, 86, 39, -35, 74, 72, 17]

Example Input: [[-151, 55, -63, -32, -120, -53], [-71, 49, -54, -156, 55, -14, 43], [-85, 46, -188], [75, 27, 38, 29, -105]]
Example Output:
[55, 55, 46, 75]