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]: [[-77, 69], [35, -21, 65], [-182, -70], [-183, 51, -62, 34, -54, -137, 55], [46, -178, -122, -50, 32, -162, -132], [-9, -196, -1, -76, -36, 38]]
[A]: [69, 65, -70, 55, 46, 38]


[Q]: [[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]
[A]: [22, -12, 60, 59, -8, 90]


[Q]: [[-68, -10, -140], [-37, -166, 24, -164, 53, -164, -168], [-63, -8, -42, 40, -184, 13, -120], [-95, 22, -132, -107, -28, 42]]
[A]:
[-10, 53, 40, 42]