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, -175], [-99, -116]]
[EX A]: [92, -99]

[EX Q]: [[-166, 3, -5, -99, -138, -161], [-57, -150, -165, -173, -42, -119, 15], [-56, -79, -48, 17], [-18, 57, -129, -20, -99, -111], [-120, -191, -196, -30], [-163, -24, 56], [-196, -8, 84, 62, -45, -19, 77], [63, -18, 37]]
[EX A]: [3, 15, 17, 57, -30, 56, 84, 63]

[EX Q]: [[-90, -115, -65, -104, -162, -104], [-3, -54, -106, -24, 89, -80], [-189, -86], [-63, -17, -53], [-43, 13, -191, -176, 70]]
[EX A]:
[-65, 89, -86, -17, 70]