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: [[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]
Example Output: [52, 8, 23, 54, -147, 61, 25, -44, 92]

Example Input: [[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]
Example Output: [79, 65, -87, 89, -2, -13, 20, -184]

Example Input: [[-40, -43, -110, -32, -174, -27], [100, 27, 53, -153, 80, -80, -142], [-125, -104, 66, 46], [-18, -102, -109, 52, 95], [-5, 81, -12, -82], [-168, -117, 44, 61]]
Example Output:
[-27, 100, 66, 95, 81, 61]