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]: [[-109, -49, -71, -4], [37, 18, -37, -47, 21, 0, -43], [90, -154], [33, 60, -7, -153], [-46, 9, 52, -84, 30, 55], [53, 14], [83, 72, 56, -46]]
[A]: [-4, 37, 90, 60, 55, 53, 83]


[Q]: [[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]
[A]: [99, 68, -32]


[Q]: [[-94, -192, -33, -200, -138, -81, 90], [52, -92, 67], [-37, -97, -85], [81, 74, -19, 85], [-153, -25, -188], [-175, -75, -150, -138, -10], [-58, 72, 68, -130, -187]]
[A]:
[90, 67, -37, 85, -25, -10, 72]