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]: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]
[A]: [95, 60, 31, -122, 66, 84, 17]


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


[Q]: [[-41, 68, 71, -91, -43, -133, 13], [91, -129], [-25, -72, -124, 71], [-23, -68, -89, -97, -18, 63], [-175, -7, -46, -87, -78, -94, -129], [-90, -3], [23, -80, -87, 90, 31, -150]]
[A]:
[71, 91, 71, 63, -7, -3, 90]