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: [[14, -64, 78], [-36, -133], [-17, 49, -19, -14], [-140, -55, 35]]

A: [78, -36, 49, 35]
****
Q: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]

A:
[100, 84, -63, -55, 78, 58, 86, 99]
****