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]: [[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
[A]: [27, 65, -27, -9, -26, -33]


[Q]: [[67, 44, 35, 59], [-191, -183, -154, 76, -98, -165], [50, 63], [72, 30]]
[A]: [67, 76, 63, 72]


[Q]: [[-85, 48, -97, 0], [-2, -180, -198, -7, 9], [20, -176, -158, -159], [-153, -63, -178, -18], [-156, 49, -10, 8, -104], [-14, 97, -138], [-103, -133, -191, -136, -71, -66, -59], [-45, 30, -123], [16, -34, -190, 39, -133]]
[A]:
[48, 9, 20, -18, 49, 97, -59, 30, 39]