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.

[EX Q]: [[-14, -150, -93, 55, -98, 54, -132], [-132, -64, -152, -37, -15], [-130, -137, -25, -40, -15, -165, 19], [-45, -121, -64, 99, -19], [-158, -6, -199, 91, -106], [-149, -111, 85, -94, 43, -185, -23]]
[EX A]: [55, -15, 19, 99, 91, 85]

[EX Q]: [[97, -79, -195, 1, -45, -140], [-172, -37, -72], [70, 17, 83, -49]]
[EX A]: [97, -37, 83]

[EX Q]: [[-175, -141, -91, 89], [22, -93, -107], [-135, 89, -110, 24, -76, 62, -34], [91, 86, -42, 86, -99, -122], [16, -89, -15, -120, 10, 42, -160]]
[EX A]:
[89, 22, 89, 91, 42]