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: [[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]

A: [38, 80, 94, 31]
****
Q: [[-23, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]

A: [46, 34, 80, 76, 68]
****
Q: [[-42, -117, -11], [0, -85, 51], [47, 90, -169, -83], [99, -66, -149, -119, -19, -47], [-72, -100, -77, 93], [-10, -39, 75, -98, -91, 6, -42], [-73, -144, -193, -37, -43]]

A:
[-11, 51, 90, 99, 93, 75, -37]
****