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: [[-183, 42, 41, 27, -157], [-49, -170, -103, -128], [94, -192], [42, 89], [-73, -107, -134], [5, -23, -9, 4, -151], [-96, -41, -85, -120], [-82, -74, -32, 89]]

Output: [42, -49, 94, 89, -73, 5, -41, 89]


Input: Consider Input: [[-138, 71, -27, -83], [-80, -136, 28, 70], [33, -23, -79, -51, -127]]

Output: [71, 70, 33]


Input: Consider Input: [[-7, 85, 28], [93, 16], [23, -174, -179, -127, -154, -134], [26, -38, 0, 80], [-156, -2, -97, -76, 21], [-189, -60, 52, -185, -76, -161], [20, 4, -192, 49, -74, 100, 34], [65, -157], [72, 44]]


Output: [85, 93, 23, 80, 21, 52, 100, 65, 72]