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: [[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]

Output: [29, 63, 12, 34]


Input: Consider Input: [[-88, -160, -127], [-151, -68, 11], [3, 36, 98, 38, -84], [38, 26, 41, -23, -148], [-5, -103, 51, 41, 16], [-122, 98], [58, -52, -122, 36, -64, -30, 41], [-28, -55, 0, -88, 0, 25]]


Output: [-88, 11, 98, 41, 51, 98, 58, 25]