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: [[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]

A: [-16, 68, 80, -85, -15, 94, 69]
****
Q: [[-94, -23, -131, -75], [94, 72, -29, -30, -63, 86], [42, -62, -33], [34, -167], [-197, 7, -89, -184, 96], [-75, -131, 2, -6, -111, 77, -36], [48, -32, -41, 73], [-178, 60, -5, 39, 40, -27], [-47, -192, -25, -122, -38, -100]]

A: [-23, 94, 42, 34, 96, 77, 73, 60, -25]
****
Q: [[-109, -93, 25, -90, 2, -104, -109], [0, -29, -192, 38], [55, -196, -85, 42, 91, -185], [-105, -117, 98, 48, 6, -15], [26, -16, -12], [-189, -55], [-158, -63, -26, -167, -32, -43], [-146, 55, 68, 53, -3]]

A:
[25, 38, 91, 98, 26, -55, -26, 68]
****