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]: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]
[A]: [-7, 91, 93, 86, 39, -35, 74, 72, 17]


[Q]: [[-132, -99, 9, -38, -77], [-7, 12, -183], [-158, -194], [-166, -39], [-115, -89, -104, -80, -147], [73, -200], [51, -31], [-51, -166, 69, -131], [26, -61, 53]]
[A]: [9, 12, -158, -39, -80, 73, 51, 69, 53]


[Q]: [[14, -99, -36, 91, 82], [-188, -21], [8, -47, -109, -127, -136], [45, -179, -112, -42, 80, 11], [-70, -173, -76, -109, 58]]
[A]:
[91, -21, 8, 80, 58]