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

Example Input: [[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]
Example Output: [31, -1, 65, -15, -38, 59, -23]

Example Input: [[52, -81, -108, -94, -170], [-156, -128, -55, -52, -32, -71], [-91, 55, -87, -136, -38], [-185, -44, 84, -173, -176, -104, 10], [-197, 12, 19]]
Example Output:
[52, -32, 55, 84, 19]