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: [[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: [[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]
Example Output: [100, 3, 97]

Example Input: [[19, 72, -142, -148, -126, -57, -83], [-11, 87, -65, -9], [-54, -72], [-192, -55], [33, 80, -165, 35, -102, 60, -103], [38, -23]]
Example Output:
[72, 87, -54, -55, 80, 38]