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: [[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: [[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]
Example Output: [53, 41, 80, 98, 91, 62]

Example Input: [[-86, -97, -94, -57], [-40, 36, -23, -131, -97, 38, -153], [-5, 31, 90, 16, -3, 4, -74], [65, 29, 99, -156, -98, -144], [51, 10, -45, -123, -51, -68, 90], [-43, -37, -131, -178]]
Example Output:
[-57, 38, 90, 99, 90, -37]