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]: [[-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]: [[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]
[EX A]: [12, -10, -48, -35]

[EX Q]: [[-48, -164, -29, -107], [-90, 2, -19, 38, 15, -37], [-48, 83, -184, -119, -154, 14], [-58, -43, -127, -86, 63, -90, -126], [-163, 70, 69]]
[EX A]:
[-29, 38, 83, 63, 70]