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: [[-132, -99, 9, -38, -77], [-7, 12, -183], [-158, -194], [-166, -39], [-115, -89, -104, -80, -147], [73, -200], [51, -31], [-51, -166, 69, -131], [26, -61, 53]]

A: [9, 12, -158, -39, -80, 73, 51, 69, 53]
****
Q: [[-101, -84, 47, -147], [-117, -82, -152, -159, 40]]

A: [47, 40]
****
Q: [[-110, -35, 68, 98, -133, -79, -137], [-133, -187, -173, 28, -19, -167], [-99, -54, -47, -197], [42, -28, -104, -111, -63], [-26, -99, -89, -72, -193, 30], [-200, 46, -163, -189], [-99, -197], [-68, -173], [60, 82, -81]]

A:
[98, 28, -47, 42, 30, 46, -99, -68, 82]
****