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]: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]
[EX A]: [38, 66]

[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]: [[-109, -198, -168, -30, -46, -87], [-2, -164, 95, -105, -183], [-65, -100, -97], [38, 100, -159, 47, -126, -57], [100, 42, -47, -83, -121, -130], [68, 65, -12, -182], [77, -119, 7, 56, -36, -112], [30, -81]]
[EX A]:
[-30, 95, -65, 100, 100, 68, 77, 30]