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: [[73, -86, -24, -107, 43], [-26, -60, -75, -9, -165], [-134, 87, 97], [100, -87, -94, -163, -189, 87, 85]]

A: [73, -9, 97, 100]
****
Q: [[32, 6, -107, -152, -73, -30], [-124, 26, -37], [21, -149, 19, -37, 72, -200], [-170, 53, 39, 0, -4, 31, -48], [49, 47, -77, 58, -75, -55, 75], [-68, 58], [-35, -170, 92, -167, -5], [-35, 44, -78, 32, -58, -31, 19]]

A: [32, 26, 72, 53, 75, 58, 92, 44]
****
Q: [[-17, -123, -156, -35], [-14, -107]]

A:
[-17, -14]
****