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]: [[18, 55, -103], [-91, 6, -103, 0, -140, -53, 94], [89, -82], [-134, 30, -157, -82, -41], [-52, 77, -163], [-122, -133, -98, 48, 87, -106, 37]]
[EX A]: [55, 94, 89, 30, 77, 87]

[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]: [[-177, -24, -197], [-164, -139, -66], [-199, -196, 80], [-177, -177, -87, -117, 12], [-69, -58, -47, -157, 52, 99, 75], [-147, -199, -192, -23, -198, -103, -129], [-163, 29, 85, 50, -78, -20, -108], [-18, -48, 43], [-68, -147, -190]]
[EX A]:
[-24, -66, 80, 12, 99, -23, 85, 43, -68]