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]: [[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]
[A]: [11, 41, 90, 72, 34, 56, 91, -133]


[Q]: [[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]
[A]: [18, 84, -83, 96, -52, 90, 76]


[Q]: [[-195, -60, -136, 39], [-167, 83, -39, -119, -94, -70], [-118, -105, -167, -2, 69], [81, -178, 50], [-192, 79, -78, -35], [0, 24], [91, 72, -72, 80, 69, -36], [-127, -21, -178, -45, -169, -174, -191], [-193, -20, -140, 18, -192, -192]]
[A]:
[39, 83, 69, 81, 79, 24, 91, -21, 18]