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]: [[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]
[EX A]: [-105, 97, 59, 80, -47, -51, 9, 70, 81]

[EX Q]: [[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]
[EX A]: [38, 80, 94, 31]

[EX Q]: [[-87, 25, -148, 12, -175, -46, 63], [74, 91, -14], [-25, -197, -114, -119], [74, 51, -143, -186, -159, -141], [-43, -74, -57, -49, -150], [-29, -124], [3, -116, 72, -128]]
[EX A]:
[63, 91, -25, 74, -43, -29, 72]