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]: [[92, 72, -149, -138, -138, -155, -174], [50, -85, -69, -41], [-48, -72, -116, -197], [70, -140, -34, -178], [1, 50, -175, 18], [-127, -73, -45, -68, 30, -175, -65], [-53, -178, 6, 14, -158, -176, -112], [7, -183], [62, -91, 38, -46, -126]]
[EX A]: [92, 50, -48, 70, 50, 30, 14, 7, 62]

[EX Q]: [[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]
[EX A]: [48, -87, 96, 54, 91, 58, -23]

[EX Q]: [[-12, -115], [-3, -64, -107, -174, -24], [-47, -170, -26, 75, 62], [8, 9, -105, -96, -136, -140], [-80, 68, -13, -199]]
[EX A]:
[-12, -3, 75, 9, 68]