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]: [[-45, 39, 37, 4], [68, -44, 26, 94], [-98, -15, -9, -140], [-73, 23, -72], [20, 53, -23, -25, -81], [92, -5, 57], [72, 39, -80], [-75, -120, 15], [13, 38, -63, -164]]
[A]: [39, 94, -9, 23, 53, 92, 72, 15, 38]


[Q]: [[76, -10, 56], [-177, -39, -40, 29, -17], [17, 77, 94, 58, 88, 39], [-2, 94, -166, -183, -48]]
[A]: [76, 29, 94, 94]


[Q]: [[-48, 96], [57, -188, 84, -89, -74], [-118, 96, -79, 12], [18, -74, 2, -131, -158], [-30, -42, 36, 66], [1, -122, -6, 39, 64], [22, -176, -184]]
[A]:
[96, 84, 96, 18, 66, 64, 22]