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: [[-195, 0], [42, 19, -7], [-155, -76, -83], [-144, 19, 88], [-139, -174, -137, 59]]

A: [0, 42, -76, 88, 59]
****
Q: [[-56, -179, -2, -94], [-5, 31, -137, -128], [-53, -151, -60, 57, -3], [-73, 0, -54, -128], [6, -74, 55, -90], [94, -128, 94, 44, -189, -38], [-167, -129, -11, 49, -60, -66], [-123, -3, 57, -159], [-120, -178, -46, -190, -26, 9, -8]]

A: [-2, 31, 57, 0, 55, 94, 49, 57, 9]
****
Q: [[22, 25, -106, 7, -64, -50, -73], [-129, -80, -18, 55, -149, -5, -47], [-143, 86, 89, -67, 59], [73, 49, -13, -1, -12], [-18, -174, -32, 28, -68, -63], [-121, -70, -119, -3]]

A:
[25, 55, 89, 73, 28, -3]
****