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]: [[-149, 97, 37, -156], [-179, -55, -35, -109], [-64, -190, 7, -6, -4, -96, -149]]
[A]: [97, -35, 7]


[Q]: [[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]
[A]: [-12, 8, 76, 96, -36]


[Q]: [[43, -54], [-130, 22, -72, 29, -14, -1], [-178, -138, 29, 90, -175, -187], [4, -66, -197, 46, -158, -90], [-91, -173, 94, -25, -10, -118, -80], [-154, 16], [-192, -181, 92, -64, -70]]
[A]:
[43, 29, 90, 46, 94, 16, 92]