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: [[-176, 36, 94, 7, 55, 29], [-66, 24, -23, -199, -43, -40], [-99, -187, -132, -129, 12]]

A: [94, 24, 12]
****
Q: [[-28, -118, -156, -57, -161], [-29, -157, -63, 77]]

A: [-28, 77]
****
Q: [[-102, -142, -141, 62, 46, 14], [-72, -142, 94, 54, -49, -13, -130], [-135, 38], [-193, -145, 54, -87, -50, -196], [-135, -162], [59, 81, 1], [60, -53], [-157, -118, -140, -57, -99, -112, -115]]

A:
[62, 94, 38, 54, -135, 81, 60, -57]
****