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]: [[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]
[A]: [99, 32]


[Q]: [[-124, -174, -30, -67], [44, -156, -76, 68, -145, -19, -178], [-18, -104, -19, -63, -15], [-99, 12, -129, 38, 4]]
[A]: [-30, 68, -15, 38]


[Q]: [[-145, -114, -151, -89, -166, -189, -117], [-20, -68], [-64, 52, 65]]
[A]:
[-89, -20, 65]