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, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]

A: [60, -36, 94, 68, 36, -64, 41]
****
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: [[84, 92, -153, -30, -74, 88, -32], [-88, -41], [62, 97, 6], [-194, 97, -120], [-189, 39, 88, 93], [-121, -24], [-145, -30, -49, 50, 87, -11, -152], [-150, -74, 87, 45, 100, 61, 47], [-99, -113, -189, -176]]

A:
[92, -41, 97, 97, 93, -24, 87, 100, -99]
****