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: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]

A: [58, 19, 68]
****
Q: [[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]

A: [0, -131, 75, 100, 90, 95, -24, 13, 10]
****
Q: [[-169, -126, -51, -169], [-163, -19, -106, -77], [-80, -145], [-4, -68], [43, -32, -165], [74, -79, -137, 34, 99, -156, 27], [-16, -68, 37], [93, -188, -116, -45, -168, 88, 7]]

A:
[-51, -19, -80, -4, 43, 99, 37, 93]
****