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: [[-61, -173, -114, -165, -42], [88, 66], [-180, -162, 19, -92, 91, -102, -166], [-98, -156, -21, -13], [34, -133, -111]]

A: [-42, 88, 91, -13, 34]
****
Q: [[-88, -78, -21], [-154, -184, -116, -32, -111, -121], [-14, -137, -43, -117], [-75, 38, -76, -138, -108, -102, 42], [12, -66, -91, 100, -55, 2]]

A: [-21, -32, -14, 42, 100]
****
Q: [[-186, -72, -18, -70, 65, 71, -132], [84, -56, -126, -8, 89, 80, -23], [-41, 30], [-63, 87, -92, -110, -44, -121], [-199, -161, -198, -112], [-37, -166], [-84, -88], [90, 58]]

A:
[71, 89, 30, 87, -112, -37, -84, 90]
****