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: [[-192, 95, -12, -36, 36, -180, 51], [-140, -53, -106, -125], [-118, -29, -137, 27, -192]]

A: [95, -53, 27]
****
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: [[-135, -12, -36, 18, -4], [-55, 100, -149, -82, -140, -100, -198], [66, -126, -156, 70, 29, -87], [50, -25, -111, -55, -119, -74, 75], [-126, -95, 43, -184, -20, -160, 43], [93, -96, -146, 97, -2, -167]]

A:
[18, 100, 70, 75, 43, 97]
****