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: [[-46, 14, -141, -77, -62], [-183, -86, -115], [-146, -60, 34], [-42, 19, -101, -49, 47], [-117, -174]]

A: [14, -86, 34, 47, -117]
****
Q: [[-61, -130, -161, 8, -36, 53, -21], [-30, 55, -48, -10, -25, -183, -1], [-92, 93], [-144, -105, -78, 90, -32], [-87, -168, -25, 75, -48, -51, -86], [10, -17, 6]]

A: [53, 55, 93, 90, 75, 10]
****
Q: [[-172, -178, 34, 17, -55, -110, 68], [-179, -99, 6, 87, 23], [-105, -6, 3, -99, -60, -53], [-170, -35, 31, 61, -85, -174], [-188, -47, -81, -193, -52]]

A:
[68, 87, 3, 61, -47]
****