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]: [[-6, 83, -124, 9, -190, 76, -8], [48, -10, -88, -125], [5, -33, -85, 83, 31, 4, -125], [53, -95, 41], [-28, -75, -55, 35], [-103, -190]]
[A]: [83, 48, 83, 53, 35, -103]


[Q]: [[-85, 59, -19, 18, -134, -95, -110], [-173, -65], [-61, -157, -42, -177, -24, -27], [-171, -162, -62, -153, -93, 70]]
[A]:
[59, -65, -24, 70]