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]: [[-82, 59, 16, -170, -136, 39], [-40, -166, -55, 98, 96], [87, 75, 43, 27, -133], [-70, -62, 32, 79, -66, -138, 43]]
[A]: [59, 98, 87, 79]


[Q]: [[11, 10, -180, -124, -192, 98], [86, -172, -162]]
[A]: [98, 86]


[Q]: [[-137, -141, -39, -60], [-150, -104, -183], [78, -50, -51, 15], [-71, -165, -77, 44, -112]]
[A]:
[-39, -104, 78, 44]