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]: [[-18, -153, 98, -195], [-154, -184, -85, -25, -121, -55], [-153, -57, -109, 42], [-101, -163], [76, 11, -100, -160, 62, -181, -1], [88, 92, 83, -44, -164], [-11, -91, 82, -166, -126, -22], [53, -186, -21, 25, -191, -100], [44, 30, -195, -56, 53, -183]]
[EX A]: [98, -25, 42, -101, 76, 92, 82, 53, 53]

[EX Q]: [[-164, 47, -194, 68, -157, -197], [-104, -30, 57, -31], [-125, 94, -188], [3, -100, -5, -114], [88, -193, 36], [34, -122]]
[EX A]: [68, 57, 94, 3, 88, 34]

[EX Q]: [[78, -80, -27, -194, -161, -52], [-45, -139, 19, -184, -196], [-113, -23, 11]]
[EX A]:
[78, 19, 11]