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: [[-15, 18, 88, 39, -96], [-65, -76, 85, 2, -58], [41, -103], [-15, -196, -94, 13], [-57, 25, -169, -18, 42, -114], [-131, -61, 20, 42, -92, -50], [-93, -35], [-22, -200, -74, 17, -67, -17]]
Example Output: [88, 85, 41, 13, 42, 42, -35, 17]

Example Input: [[57, 81, -73, 26], [-40, -99, 67, -180, 25], [75, 86, -116, 56, -141, -111], [-127, 59, -108, -86, -63, 24, -144], [-9, -161, 75, 26]]
Example Output: [81, 67, 86, 59, 75]

Example Input: [[-167, -148, -47, -59, -142, 79], [-196, -80, -158, -49, 98, -123], [-43, -173, 16, -96, -31], [-44, -110, -123, -19], [34, -149], [100, -32, 63, -110, 16, -16]]
Example Output:
[79, 98, 16, -19, 34, 100]