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: [[-6, 41, -190], [-47, 89], [29, -17, -135]]

A: [41, 89, 29]
****
Q: [[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]

A: [57, 80, -20, -50, 8, 64]
****
Q: [[-80, -135, 74, 52, -88, 40], [-41, 72], [-104, -150, -130, 87, -142, -89, 16], [-152, 93, -160]]

A:
[74, 72, 87, 93]
****