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.

[Q]: [[-138, -16, -188, -181, 86, -151], [56, -176, 31, -164, 39, 51]]
[A]: [86, 56]


[Q]: [[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]
[A]: [99, 32]


[Q]: [[-159, -130, 34, 16], [-3, 95], [83, -44, -200, 5, 89, 33], [-121, -31, -65, -185, -117, 65, 4], [59, -198, 55, -68, -64, -52]]
[A]:
[34, 95, 89, 65, 59]