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: [[-123, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]

A: [-68, 30, 99, 15]
****
Q: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]

A: [98, 30, 96, 87, 96, 67, 53]
****
Q: [[-128, -199], [-109, -165, -110], [-169, -71, 19, -112, -42, -195, 47], [-96, 15, -145], [-40, -192, -73, -53, -64]]

A:
[-128, -109, 47, 15, -40]
****