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: [[-117, -110, 36, 18], [-15, 40, -140], [-33, 79, 8, 42, -4, 84]]

A: [36, 40, 84]
****
Q: [[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]

A: [79, 65, -87, 89, -2, -13, 20, -184]
****
Q: [[30, -137, -34, -74, -127, 47], [4, -135, -62, -31, -64], [92, -178, -136], [45, -169, -134, -128, 54, 90, 94]]

A:
[47, 4, 92, 94]
****