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: [[-88, -73, 65, 51, -100], [-75, -195], [-115, 4, -152, -151, -65, 95, 85]]

A: [65, -75, 95]
****
Q: [[-163, -129, -176, 12], [-28, -195, -125, -107, 23, 69], [-128, -129, -47, -30], [-53, -56, -32, -67, -7, -81, -156]]

A: [12, 69, -30, -7]
****
Q: [[-178, 15, -65, -145, 37], [-85, -90, 91], [74, 0, -177, -51, -99, -172, -125], [51, -70, -42, -86, 78, -75, -139], [-57, 85, -92, -25, 49], [-82, -183, 73], [-81, -55, 27, -120, -190], [-16, 62, 47], [-147, 30, -94]]

A:
[37, 91, 74, 78, 85, 73, 27, 62, 30]
****