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]: [[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]
[A]: [76, -40, 87, 30, 27, 27, 51]


[Q]: [[51, -67, -81, -30, 67, -10, -110], [-187, 85], [-127, -137, -194, 90, -185, -149, -163], [-54, -34, -105, -77, -65, 76], [-121, 81, -112, -28], [-65, 97, 98], [8, -183, 72, -81, 15, 94, 32]]
[A]: [67, 85, 90, 76, 81, 98, 94]


[Q]: [[-79, 60, 100, 85, -114, -113], [44, -77], [64, -164, -23], [-136, -10, -144, -38], [-118, -55, 22, 76, 79, 96, -16]]
[A]:
[100, 44, 64, -10, 96]