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: [[-42, -87], [-101, -39, -128, 73, -16], [85, -168], [-166, -107, -135, -139, -35, 76]]

A: [-42, 73, 85, 76]
****
Q: [[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]

A: [19, -96, 60, 50, 63, 58, 92, 67]
****
Q: [[59, -67, 79], [33, 100, 67, -182], [-10, 14, 20, 46, -85]]

A:
[79, 100, 46]
****