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]: [[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]
[A]: [93, -40, -72, 13, 91, 35, 33, 28]


[Q]: [[-58, 41, -14, -59, -168, -150, 61], [-110, -158, 28], [-109, 5, -79, -55, 95, -140], [8, -194, 9, -19, -121]]
[A]: [61, 28, 95, 9]


[Q]: [[-85, -126, 7, -183], [97, -65], [38, 49, -15, -134], [-137, 93, -34, 5], [76, -120, -49, 57], [-39, -27, -96, 87, -74, 56]]
[A]:
[7, 97, 49, 93, 76, 87]