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: [[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]

A: [-12, 8, 76, 96, -36]
****
Q: [[-164, 47, -194, 68, -157, -197], [-104, -30, 57, -31], [-125, 94, -188], [3, -100, -5, -114], [88, -193, 36], [34, -122]]

A: [68, 57, 94, 3, 88, 34]
****
Q: [[-132, 55, -53], [-9, -176, 95, -68, -97, -146, -50], [-128, -84], [-95, 80, -85, -89], [55, 44, -35], [85, 82, -148, -181, -50], [-176, -169, -189, 11, -198, -120, 12], [-174, -139, -151, 60], [20, -159]]

A:
[55, 95, -84, 80, 55, 85, 12, 60, 20]
****