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]: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]
[A]: [21, -38, 99, 89, 40, 46, 69]


[Q]: [[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]
[A]: [-17, -31, 56, 64]


[Q]: [[82, 92, -117, -45], [90, 18], [-179, -199, -143, -19, -15], [-200, -7], [56, -77, -172], [65, -46, -48], [-19, -194, -49, -175], [25, -164], [39, 13, 100, 22, -177, 15]]
[A]:
[92, 90, -15, -7, 56, 65, -19, 25, 100]