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]: [[-59, 10, -4, -62], [-94, -163, -126, -159, -59], [87, -50, -102, -181, 99, -138], [48, -154, 17, -191], [-35, -12, -114, 18, -184], [80, 16, -193]]
[A]: [10, -59, 99, 48, 18, 80]


[Q]: [[-65, -80], [-56, -98, 43, -194], [-152, -199, -81, -153, -164, -184, 97]]
[A]: [-65, 43, 97]


[Q]: [[-195, -186], [-141, 19, -30, 55, -122, 86, -89]]
[A]:
[-186, 86]