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]: [[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]
[EX A]: [97, 23]

[EX Q]: [[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]
[EX A]: [98, 79, 97, 65, 71, 43, -72]

[EX Q]: [[-130, -27], [-54, 56, -69, -82, -115, -28], [96, -141, 59, -62, -9, -175], [-41, -74, 23, -136, 52, -126], [-107, -160, -159], [-158, -56], [65, -181, -177, -132, -73, -198], [-196, -67, -103]]
[EX A]:
[-27, 56, 96, 52, -107, -56, 65, -67]