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]: [[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]
[A]: [-17, -31, 56, 64]


[Q]: [[84, -86, 87, -13, 3, -132, 58], [41, -141, -89], [45, 53, 6, -87]]
[A]: [87, 41, 53]


[Q]: [[89, 76, -152, -192], [67, -121, -66, -108], [33, -167, 52], [-54, -186], [-137, 70, -20], [62, 87, -130, -185], [-191, 48], [-69, 11, -39, 14, -155], [-187, -103, 52, 84, 94, 33]]
[A]:
[89, 67, 52, -54, 70, 87, 48, 14, 94]