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: [[-105, -189, 19, -65, -189, -88, -117], [39, 62], [44, -144]]

A: [19, 62, 44]
****
Q: [[-110, -23, -169, 17, -26], [-173, -98, 69, 24], [-57, 55, 60, 96, -31, -136], [-68, -152, -107, 74, 75], [-122, 20, -98, 36, -48, -92], [-178, -151]]

A: [17, 69, 96, 75, 36, -151]
****
Q: [[71, -114, -25], [-24, 67, 50, -2], [39, -14], [-80, 58, -70, -191, 14], [-163, -89], [23, 19]]

A:
[71, 67, 39, 58, -89, 23]
****