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]: [[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]
[EX A]: [0, -131, 75, 100, 90, 95, -24, 13, 10]

[EX Q]: [[31, -148, -130, -65], [-66, -101], [35, -34, -161, -75, 87, 82], [-134, 60, 2, -194, -112, -173], [-150, -61, -119, 78, 51], [-9, -140]]
[EX A]:
[31, -66, 87, 60, 78, -9]