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]: [[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]
[A]: [10, 83, 86, 22]


[Q]: [[-73, 76, -100, -143], [-74, -141], [73, -82, -103, -88, 70, -159, -124], [-110, -78, 44, 57, -61], [41, -83, -173, -44, -181]]
[A]: [76, -74, 73, 57, 41]


[Q]: [[-171, 36, -61, 69, -9, -146], [-110, 46, 99, -120, 97], [-12, 37, -8, 70], [-150, 77, -108], [-160, -149], [-143, -92, 4, 83, 100, -110, -62], [-68, 8, -105, -195], [-153, 93, 82, 38, -69, -165, -109], [-166, -28, -81, -134]]
[A]:
[69, 99, 70, 77, -149, 100, 8, 93, -28]