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: [[35, -101, 13, 4, -151, 87], [50, 52, -34, -161], [-184, -19, -4, -152], [82, 30, -168, -115, -193, -139], [12, -97, -193]]

A: [87, 52, -4, 82, 12]
****
Q: [[-81, -174, -79], [6, -131, -75, 40]]

A: [-79, 40]
****
Q: [[-96, 44, 45, 38, -39], [41, -120, -64, 77, -147], [-20, 4, 96], [98, -69, -110, 84], [-109, -13, -1, -123, -141, -175]]

A:
[45, 77, 96, 98, -1]
****