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]: [[-150, 80, -128, -124], [-179, 83, -152, 11, -187, -1, -81], [88, -154, -20], [-59, -40, -39, -188], [-8, -53, 29, -181, 77], [-69, -7, 60, 22, -121], [-51, -96, -16, -120], [-79, 93, -86, -16, -96, -74, -187], [-39, -195, 86, 32]]
[A]: [80, 83, 88, -39, 77, 60, -16, 93, 86]


[Q]: [[-51, -92, -181, -134, 56, -85], [-87, -90, -147], [97, -178, -18, -191, -55, -164], [5, -145], [37, 67, 75, -112, -191, 34], [100, 17], [-165, 4, 39, -184, -136], [-94, 22, -33, 24, -13, 38]]
[A]: [56, -87, 97, 5, 75, 100, 39, 38]


[Q]: [[-147, 32, -195, -137, -75, -67, -47], [-98, -16], [-60, -13, 51], [45, -134, -36, -44], [3, 18, -118, -148], [89, -152, 49, -164], [97, 68, 61], [-64, -179, -124, -55, -64], [13, -137, 96, -173, 10]]
[A]:
[32, -16, 51, 45, 18, 89, 97, -55, 96]