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]: [[-58, 41, -14, -59, -168, -150, 61], [-110, -158, 28], [-109, 5, -79, -55, 95, -140], [8, -194, 9, -19, -121]]
[A]: [61, 28, 95, 9]


[Q]: [[-125, -150, -5], [-100, 46, 65, 64, 5, -15, -82]]
[A]: [-5, 65]


[Q]: [[-108, -141, 25, -69, 59], [-64, -104]]
[A]:
[59, -64]