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]: [[-2, -170, -178, -115], [52, 57, -200, -86, 14, 31, -19], [-121, 20, -2, -173, -85, -115, 97], [30, -119, -33], [-40, -53, 24, -133, -196]]
[A]: [-2, 57, 97, 30, 24]


[Q]: [[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]
[A]: [92, 46, 25, 19]


[Q]: [[58, 54, 34], [-63, 38, 25, -64, 28, -112, -92], [-96, 65, -184, -101], [-94, -121], [-77, -94, 44, -122, -4, 98, 14], [-161, 72, 25, -61, -153, 60], [-72, -164, -13, -153, 94, -156, -127], [-80, 8, -120, -88]]
[A]:
[58, 38, 65, -94, 98, 72, 94, 8]