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]: [[-24, 92, -135, -45, -58, 69], [-171, -28], [-40, -44, 82, 82, 98], [-153, -155, -64, 72, -59, -39, -25], [-167, -30, -48, 23, 4, -6]]
[A]: [92, -28, 98, 72, 23]


[Q]: [[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]
[A]: [86, 46, -128, 81, 40, 67]


[Q]: [[-110, -23, -169, 17, -26], [-173, -98, 69, 24], [-57, 55, 60, 96, -31, -136], [-68, -152, -107, 74, 75], [-122, 20, -98, 36, -48, -92], [-178, -151]]
[A]:
[17, 69, 96, 75, 36, -151]