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]: [[-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]: [[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]
[EX A]: [0, -131, 75, 100, 90, 95, -24, 13, 10]

[EX Q]: [[-65, 75, -108, -133, 7, 69, -80], [-127, -131, 81, -105, -91, -22], [-64, 44, -134, -126, 30, -194, -159], [28, -49, -193], [22, -4], [-143, -167], [-150, 40, 78, 79, -34], [-55, -105, -167, -58, -168, -100, -18], [-41, -6, 26]]
[EX A]:
[75, 81, 44, 28, 22, -143, 79, -18, 26]