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, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]
Example Output: [55, 51, 83, 61, -9, 67, 15]

Example Input: [[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]
Example Output: [-105, 97, 59, 80, -47, -51, 9, 70, 81]

Example Input: [[45, 73, -80, -38], [-150, -41, -120, 51, 48, -184], [-61, -6, 51, -30, 69, 15], [73, -142, -25, 20, -115], [-77, -140], [-151, 48, -171, -61, -136, 59, 31], [-197, -15, -26, -18, -122, -140], [42, 77, -71, -180, 99, -121, -39]]
Example Output:
[73, 51, 69, 73, -77, 59, -15, 99]

