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, -64, -37, -55], [-170, -193, 73, 94], [-21, -159, -100], [-59, -193, -156, 76], [21, -147, -140, -165, 85, -14], [-51, 57, 85, 1, -69, 93], [-156, -17, 72], [-48, -165, -96, -148, 5, -147], [-81, -55, 87, -12, -9]]

A: [-37, 94, -21, 76, 85, 93, 72, 5, 87]
****
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: [[73, -32, -28, 26], [-166, -19, -128, 46, -178, -153, -136]]

A:
[73, 46]
****