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: [[-194, -52, 35, -70], [-101, -197]]

A: [35, -101]
****
Q: [[-95, -68, -90, -106], [-7, -42, -177, 75, 14, -98, 19], [-10, -36], [6, 31, 55, -25, -19], [-20, -159, 89], [-70, 94, -66, -9, -34, -26, 51], [-12, 38, 23, 52, -196], [-103, 22, -32, -188, -4, -15, -108], [96, -125]]

A: [-68, 75, -10, 55, 89, 94, 52, 22, 96]
****
Q: [[-41, -198, -103, 12, -98], [-36, -28, 19, 36], [-81, -16, -173, -180, -154, -77], [-66, 45, -87, -96, -11, -70], [-158, 94], [77, 29, -33, -65, -73], [-15, -8, -68, 33, -143, -36], [-78, 29, 67, 66]]

A:
[12, 36, -16, 45, 94, 77, 33, 67]
****