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]: [[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]
[A]: [36, 86, 10, 81, 69, 41, 91, 34]


[Q]: [[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]
[A]: [71, 71, -38, 60, 7, 97, 76]


[Q]: [[-104, -174, -96, -144, -190, -185], [-59, -64], [86, 29], [-34, -192, 79, -109, -99, -98, 13], [-119, -40, -114, -103, -165, -49], [-1, 62, 52, -119, -127, 2, -5], [88, -190, -118, 13, -87]]
[A]:
[-96, -59, 86, 79, -40, 62, 88]