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, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]
[EX A]: [79, 0, -71, 32, 98, 26, 20, 70]

[EX Q]: [[79, -173, 27, 69, -53, -140, -166], [-198, -73, 95, 10], [82, -186, -168, -94, -6], [52, -73, 66, -106, 48, -37], [-78, -67, -36, -147, -18, -11]]
[EX A]: [79, 95, 82, 66, -11]

[EX Q]: [[85, -79, 72], [-66, 54, -183, 74, -13, -96], [-135, -19, -28, 3, -57, -103], [-110, -104, -21], [-124, -123, -19, -191, 93, -108, -4], [36, -125, -17, -141, -112, -123], [-68, 56, 42, 74, -52, -51]]
[EX A]:
[85, 74, 3, -21, 93, 36, 74]