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: [[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]
Example Output: [-20, 93, 17, 91, 69, 44, -21, 98, 25]

Example Input: [[4, 27, 7, 92, -49], [-198, 59, -131, -73], [-130, -48, -135, 58], [57, -189, -99, 66, 51, 1], [90, 55, -174, -161, -148, -181]]
Example Output: [92, 59, 58, 66, 90]

Example Input: [[-93, 22, 100, -159, 23], [-113, 71, -170, 51, 8, -90], [-106, -174, -167, -20, -189, -3, -139], [-12, 56, 69, -43, 69], [-61, 48, -120, -144, -97, -8, -46], [-105, -47, -168, -194], [22, -95, 71], [35, -132, -39], [-133, 33, -68, -9, -46, 61]]
Example Output:
[100, 71, -3, 69, 48, -47, 71, 35, 61]