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: [[-151, -194], [-174, 80, 60], [-84, 65, -199]]

A: [-151, 80, 65]
****
Q: [[-195, 93, 71, -124, 21, -20, 92], [-58, -185, 7, -57, -20, -64], [-19, -117, 60, -165, 31]]

A: [93, 7, 60]
****
Q: [[-140, -140, -160, -97, -45, 0, 26], [-199, -185, -126], [26, -67], [-136, -172, -49]]

A:
[26, -126, 26, -49]
****