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: [[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]
Example Output: [97, -5, 47, -13, 95]

Example Input: [[-161, 6, 40], [30, -162, 99], [-173, -39, -144, 42, -160, -66, -74]]
Example Output:
[40, 99, 42]