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: [[80, -88, 28, 30, 69, 3], [55, -51, -83, 56, -134, 39, -32], [-66, -147, 46], [-169, 29, 6], [-140, 14, -116, -172, -85, -173, 3]]

A: [80, 56, 46, 29, 14]
****
Q: [[-35, 83, -145, -47, -160, -105], [-174, -29, 64, -182, 87, 53, -148], [8, -178, 46, 54], [-46, -140, -18], [-42, 51, -72], [-61, -17, -13, -52, -161]]

A: [83, 87, 54, -18, 51, -13]
****
Q: [[-56, -166, 17, -196], [-18, -116, -119, -34, -113, -185, 21]]

A:
[17, 21]
****