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]: [[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]
[EX A]: [20, -71, 9, 97, 46, 17, 90]

[EX Q]: [[-164, 46, -40, 79, -196], [-5, 88, -93, 31, -195, 67], [-68, -147, -199, 93], [-77, -196, 74, -107, 89], [32, -122, 10, -116, -112], [-134, -113, 40, -68, -86]]
[EX A]: [79, 88, 93, 89, 32, 40]

[EX Q]: [[86, -1], [-31, -54, 78], [49, -11, 99, -12], [-57, -36, -169, 99, -190, -179, -55], [-120, 77, -184, -35], [-11, 17, 55, -125, 9, 78, -48], [1, 94, -176, -26], [-179, -108, 29, -100, -168], [-124, 1, -47, 31, 15]]
[EX A]:
[86, 78, 99, 99, 77, 78, 94, 29, 31]