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: [[-194, -30, -77, -21], [35, 86], [-189, -19, 29, -169, -32, -38, -25], [100, -144, 85]]

A: [-21, 86, 29, 100]
****
Q: [[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]

A: [-6, 36, 29, -46, -41, 35]
****
Q: [[-65, -63], [87, 55, 34], [-118, -114, -48], [-95, -180, -82, -44, -136], [63, -88, -182, -182, -3, -70], [-24, 54], [5, 13, 8, 18, 88], [53, -175, -155, -85, -131, 76], [-16, -200, -28, 92, -116]]

A:
[-63, 87, -48, -44, 63, 54, 88, 76, 92]
****
