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.

Q: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]

A: [38, 66]
****
Q: [[99, -101, -88, 15, -73], [38, -143, -93, 43, -104, 48], [-39, -90, 31], [-146, 49, -10, 77, -49, -177]]

A: [99, 48, 31, 77]
****
Q: [[81, -147, -71, 28], [87, -186, -59, -195, 58], [-188, 54], [-198, -59, -35, -113, 76, -19, -158], [-11, -142, -168, -118, -145, -105, -198], [-57, -119, 90, 59]]

A:
[81, 87, 54, 76, -11, 90]
****