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]: [[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]
[EX A]: [-17, -31, 56, 64]

[EX Q]: [[-23, 46, 40, -162, -97], [0, 78, -38, -80], [1, 79, 15, -7, -40, -88], [-117, -22], [96, -80, 62]]
[EX A]: [46, 78, 79, -22, 96]

[EX Q]: [[-148, -131, -196, 51, 30], [-175, -86, -101, -86, -99, -71], [-97, -162, -190], [-142, 4, 72]]
[EX A]:
[51, -71, -97, 72]