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]: [[-162, -197, 57, -149], [71, -127, 21, -120, 56, -18, 82], [-18, 1, -152, -113, 5, -53], [-138, 28], [70, -65]]
[EX A]: [57, 82, 5, 28, 70]

[EX Q]: [[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]
[EX A]: [98, -11, 98, 26, 10]

[EX Q]: [[-91, 59, -162, -144, -50, 42, -45], [-120, 47, -128, -130, -195], [-28, -3], [86, -6, 57, -91], [-99, 22], [-87, -47, -146, -110, -8, 50]]
[EX A]:
[59, 47, -3, 86, 22, 50]