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: [[-181, -160, -10, -6, -128], [78, -145, -191, -36]]

A: [-6, 78]
****
Q: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]

A: [12, -16, 41, 50]
****
Q: [[-182, 92, -191], [-195, -162, 46, 22, -29, -13], [-32, -163], [29, -89, -105, 76, -122], [-140, 38, -162, 63, -100, -35]]

A:
[92, 46, -32, 76, 63]
****