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]: [[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]
[EX A]: [52, 39, 95, 2, -17, 57, 73, 70, 44]

[EX Q]: [[15, 28, 31, -77, -149, -140, 48], [-50, -108, -87, 32, -108], [-138, -7]]
[EX A]:
[48, 32, -7]