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: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]

A: [60, -32, 68, 93, 24, 26, 7, 85]
****
Q: [[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]

A: [40, 84, 55]
****
Q: [[-64, -154, -89], [92, -198, -37, 17], [-35, -192, -114]]

A:
[-64, 92, -35]
****