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: [[-56, 1, 91, 72, -43, 93, 97], [82, -37, 68, 90, -1], [-77, -107, -45, -85, 93], [48, -60, -115, -121, 52, -56, -173], [-75, -154, 52, -51, -70], [-133, -87, -29, -183, -168], [37, -115, -149, -51], [-168, -135, 79], [-46, 13, 24, -91, -91, 80]]
Example Output: [97, 90, 93, 52, 52, -29, 37, 79, 80]

Example Input: [[18, -24, 22, -153, 38], [34, 6, -5, 98, -168], [-137, -175, -142, 39, 10, -54, -95], [-127, -48, -200, 24], [-166, -170, -38, -121], [-60, 1]]
Example Output: [38, 98, 39, 24, -38, 1]

Example Input: [[-198, 92, -39, -152], [-171, 94, 95, 62, -14, -171, -111], [55, -187, -180], [-85, 68, 83], [-154, -57, -132, -66, -21, -22, -8], [-187, -8, -7], [-156, 7], [-109, 40, -43], [-92, -21, -109]]
Example Output:
[92, 95, 55, 83, -8, -7, 7, 40, -21]