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: [[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]

A: [60, 26, 61, 74, -28]
****
Q: [[-170, -186, -15], [-130, -93, -50, 88, -170], [-15, -144, -141], [-85, -104, -115]]

A: [-15, 88, -15, -85]
****
Q: [[-172, -55], [-97, -55, -41], [13, -159], [-76, 42, 37, -98, -7, -63, 34]]

A:
[-55, -41, 13, 42]
****