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.

Input: Consider 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]]

Output: [38, 98, 39, 24, -38, 1]


Input: Consider Input: [[83, -95, 37, -7], [33, -23, -133, -134, 77], [52, -161, 1, 34, -123, -29], [-130, 51, 97, -29], [-14, 36, -88, 49, -199]]

Output: [83, 77, 52, 97, 49]


Input: Consider Input: [[-47, -166, -52, 34, -20, -48], [-147, -136, -19, -156, -116, -83], [-152, -14, -116], [-188, 10], [-117, 77, -1], [-114, 9], [38, 44, -5, 52, -174, -152, -180], [-197, 65, -84, 16, -103, 71], [5, 73, 8]]


Output: [34, -19, -14, 10, 77, 9, 52, 71, 73]