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: [[-166, 3, -5, -99, -138, -161], [-57, -150, -165, -173, -42, -119, 15], [-56, -79, -48, 17], [-18, 57, -129, -20, -99, -111], [-120, -191, -196, -30], [-163, -24, 56], [-196, -8, 84, 62, -45, -19, 77], [63, -18, 37]]

A: [3, 15, 17, 57, -30, 56, 84, 63]
****
Q: [[-101, -84, 47, -147], [-117, -82, -152, -159, 40]]

A: [47, 40]
****
Q: [[-120, 75, -63, 24, -12, 90], [-53, -92, -144, 47, 13, -42]]

A:
[90, 47]
****