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: [[50, -128, 17, 76, -122, 50], [6, -23, -7, -120, 28, -26], [-16, -60, -152], [28, -111, 22, -26, -61, -141, -16], [-51, 74]]

A: [76, 28, -16, 28, 74]
****
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: [[38, 75, -169, -170, -44, -185, 48], [-31, -22, -184, -117, -14, -29, 6], [30, 2, -145, 50, 91], [-5, -199, 48, 69, 58, -51]]

A:
[75, 6, 91, 69]
****