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: [[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]

A: [-93, 50, 32]
****
Q: [[-59, 10, -4, -62], [-94, -163, -126, -159, -59], [87, -50, -102, -181, 99, -138], [48, -154, 17, -191], [-35, -12, -114, 18, -184], [80, 16, -193]]

A: [10, -59, 99, 48, 18, 80]
****
Q: [[49, -38, -95], [-4, 24], [60, -32, -195, -168, -98, -191], [-17, -90, -181, -83, -162], [66, -171, -159], [-131, -160, 74, -77], [6, 78, -108, -181], [17, -68, -37], [-104, -121, -29, 45, -150, -127, -14]]

A:
[49, 24, 60, -17, 66, 74, 78, 17, 45]
****